The black-box complexity of nearest-neighbor search

@article{Krauthgamer2005TheBC,
  title={The black-box complexity of nearest-neighbor search},
  author={Robert Krauthgamer and James R. Lee},
  journal={Theor. Comput. Sci.},
  year={2005},
  volume={348},
  pages={262-276}
}
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answers (1 + ε)-ANN queries in polylog(n) time using only polynomial space. We then study which families of metric spaces admit efficient ANN schemes in the black-box model, where only oracle access to the distance function is given, and any query consistent with the triangle inequality may be asked. For ε < 5 , we offer a… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 41 extracted citations

59 Citations

0510'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…