New LSH-based Algorithm for Approximate Nearest Neighbor

dc.contributor.author	Andoni, Alexandr
dc.contributor.author	Indyk, Piotr
dc.date.accessioned	2005-12-22T02:40:39Z
dc.date.available	2005-12-22T02:40:39Z
dc.date.issued	2005-11-04
dc.identifier.other	MIT-CSAIL-TR-2005-073
dc.identifier.other	AIM-2005-031
dc.identifier.uri	http://hdl.handle.net/1721.1/30583
dc.description.abstract	We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time ofO(dn^{1/c^2+o(1)}) and space O(dn + n^{1+1/c^2+o(1)}).
dc.format.extent	12 p.
dc.format.extent	11656417 bytes
dc.format.extent	559939 bytes
dc.format.mimetype	application/postscript
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.relation.ispartofseries	Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subject	AI
dc.subject	locality sensitive hashing
dc.subject	nearest neighbor
dc.subject	high dimensions
dc.title	New LSH-based Algorithm for Approximate Nearest Neighbor