Fast and memory-efficient NN search in wireless data broadcast

Sang-Geun Lee, Myong Soo Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

It is observed, surprisingly, that existing nearest neighbor search methods may not work well on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search in memory-efficient manner by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach outperforms existing ones considerably in terms of access time without compromising tuning time.

Original languageEnglish
Title of host publicationHigh Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings
PublisherSpringer Verlag
Pages662-671
Number of pages10
ISBN (Print)3540393684, 9783540393689
DOIs
Publication statusPublished - 2006
Event2nd International Conference on High Performance Computing and Communications, HPCC 2006 - Munich, Germany
Duration: 2006 Sep 132006 Sep 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4208 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on High Performance Computing and Communications, HPCC 2006
CountryGermany
CityMunich
Period06/9/1306/9/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fast and memory-efficient NN search in wireless data broadcast'. Together they form a unique fingerprint.

Cite this