The black-box complexity of nearest-neighbor search
From MaRDI portal
Publication:2581270
DOI10.1016/j.tcs.2005.09.017zbMath1081.68013MaRDI QIDQ2581270
James R. Lee, Robert Krauthgamer
Publication date: 9 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.017
approximation algorithms; similarity search; doubling metric spaces; nearest neighbor searching; closest point queries
Related Items
Unnamed Item, Metric Spaces with Expensive Distances, Indexability, concentration, and VC theory, Making doubling metrics geodesic, A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics, Fractal dimension and lower bounds for geometric problems, Space-Time Tradeoffs for Proximity Searching in Doubling Spaces, COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES
Cites Work