scientific article; zbMATH DE number 1445326

MaRDI QIDQ4952641zbMATH OpenFDO

Authors Sunil Arya, Ho-Yam Addy Fu

Publication date 10 May 2000

zbMATH Keywords

approximate nearest neighbor problem

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Expected-Case Complexity of Approximate Nearest Neighbor Searching
• scientific article; zbMATH DE number 437552
• Approximate nearest neighbor: towards removing the curse of dimensionality
• An empirical study of a new approach to nearest neighbor searching
• Approximate nearest neighbor queries revisited

Cited in

(7)

• Nearest-neighbor searching under uncertainty. I
• Can nearest neighbor searching be simple and always fast?
• Average-Case Lower Bounds for Searching
• A case study in comparison based complexity: Finding the nearest value(s)
• Expected-Case Complexity of Approximate Nearest Neighbor Searching
• The analysis of a probabilistic approach to nearest neighbor searching
• An empirical study of a new approach to nearest neighbor searching

This page was built for publication:

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