Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

FOCS
2006
IEEE

favoriteEmaildiscussreport

176views Theoretical Computer Science» more FOCS 2006»

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

13 years 10 months ago

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

Download www.mit.edu

We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ). This almost matches the lower bound for hashing-based algorithm recently obtained in [27]. We also obtain a space-efﬁcient version of the algorithm, which uses dn + n logO(1) n space, with a query time of dnO(1/c2 ) . Finally, we discuss practical variants of the algorithms that utilize fast bounded-distance decoders for the Leech Lattice.

Alexandr Andoni, Piotr Indyk

Real-time Traffic

D-dimensional Euclidean Space | FOCS 2006 | Nearest Neighbor Problem | Query Time | Theoretical Computer Science |

claim paper

Related Content

» SPEC Hashing Similarity Preserving algorithm for Entropybased Coding

» Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

» An Investigation of Practical Approximate Nearest Neighbor Algorithms

» Bilevel Locality Sensitive Hashing for kNearest Neighbor Computation

» Similarity Search in High Dimensions via Hashing

» High dimensional reverse nearest neighbor queries

» Quality and efficiency in high dimensional nearest neighbor search

» Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces

» Analysis of approximate nearest neighbor searching with clustered point sets

Post Info
More Details (n/a)

Added	11 Jun 2010
Updated	11 Jun 2010
Type	Conference
Year	2006
Where	FOCS
Authors	Alexandr Andoni, Piotr Indyk

Comments (0)