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)})

Andoni, Alexandr

Indyk, Piotr

We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c 2+o(1)) and space O(dn+n1+1/c 2+o(1))

Alexandr Andoni

Piotr Indyk

CiteSeerX

New LSH-based algorithm for approximate nearest neighbor

DSpace@MIT

New LSH-based Algorithm for Approximate Nearest Neighbor

http://publications.csail.mit.edu/tmp/MIT-CSAIL-TR-2005-073.pdf

New LSH-based Algorithm for Approximate Nearest Neighbor

Abstract

Similar works

Full text

Available Versions

CiteSeerX

DSpace@MIT