scientific article; zbMATH DE number 1445326

zbMATH Open0956.68048MaRDI QIDQ4952641FDOQ4952641

Authors: Sunil Arya, Ho-Yam Addy Fu 

Publication date: 10 May 2000

Title of this publication is not available (Why is that?)

Recommendations

• Expected-Case Complexity of Approximate Nearest Neighbor Searching
• scientific article; zbMATH DE number 437552
• Approximate nearest neighbor: towards removing the curse of dimensionality
• scientific article; zbMATH DE number 1893569
• Approximate nearest neighbor queries revisited

zbMATH Keywords

approximate nearest neighbor problem

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Average-Case Lower Bounds for Searching
• Title not available (Why is that?)
• Nearest-neighbor searching under uncertainty. I
• Title not available (Why is that?)
• Expected-Case Complexity of Approximate Nearest Neighbor Searching
• Can nearest neighbor searching be simple and always fast?

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)