Approximate Nearest Neighbor Search for Low Dimensional Queries
classification
💻 cs.CG
cs.DS
keywords
approximatedatanearestneighborproblemconstraineddespitedimension
read the original 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, while the data is high-dimensional. We show that this problem can be solved efficiently despite the high dimensionality of the data.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.