Approximate nearest neighbor search for low dimensional queries

Sariel Har-Peled, Nirman Kumar

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

Abstract

We study the Approximate Nearest Neighbor problem for metric spaces where the query points are constrained to lie on a subspace of low doubling dimension.

Original languageEnglish (US)
Title of host publicationProceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011
PublisherAssociation for Computing Machinery
Pages854-867
Number of pages14
ISBN (Print)9780898719932
DOIs
StatePublished - 2011

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Approximate nearest neighbor search for low dimensional queries'. Together they form a unique fingerprint.

  • Cite this

    Har-Peled, S., & Kumar, N. (2011). Approximate nearest neighbor search for low dimensional queries. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011 (pp. 854-867). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association for Computing Machinery. https://doi.org/10.1137/1.9781611973082.67