Approximate nearest neighbor search for low dimensional queries

Authors

Sariel Har-Peled, University of Illinois Urbana-ChampaignFollow
Nirman Kumar, University of Illinois Urbana-Champaign

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.

Publication Title

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Recommended Citation

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