A unified approach to approximate proximity searching

DOI10.1007/978-3-642-15775-2_32MaRDI QIDQ3586478zbMATH OpenOpenAlexFDO

Authors Sunil Arya, David M. Mount, Guilherme D. Da Fonseca

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15775-2_32

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Approximate nearest neighbor queries revisited
• scientific article; zbMATH DE number 1775451
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Space-time tradeoffs for approximate nearest neighbor searching

Cited in

(8)

• Proximity Search with a Triangulated Spatial Model
• A unified and efficient solution to the room search problem
• Approximate polytope membership queries
• Local Density Estimation in High Dimensions
• Proximate point searching
• Fixed queries array: A fast and economical data structure for proximity searching
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.

This page was built for publication: A unified approach to approximate proximity searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586478)