scientific article; zbMATH DE number 6783438

MaRDI QIDQ5365086zbMATH OpenFDO

Authors Nirman Kumar, Sariel Har-Peled

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133103

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Approximate nearest neighbor search for low-dimensional queries
• Approximate nearest neighbor queries revisited
• scientific article; zbMATH DE number 437552
• Approximate nearest neighbor search in high dimensions
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• scientific article; zbMATH DE number 1775451
• Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data
• New directions in approximate nearest-neighbor searching
• A strong lower bound for approximate nearest neighbor searching
• scientific article; zbMATH DE number 7204982

Cited in

(10)

• Approximate nearest neighbor for curves: simple, efficient, and deterministic
• Approximate nearest neighbor search for low-dimensional queries
• Approximate nearest neighbors and sequence comparison with block operations
• Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
• Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
• scientific article; zbMATH DE number 2065612 (Why is no real title available?)
• Distributed Adaptive Binary Quantization for Fast Nearest Neighbor Search
• scientific article; zbMATH DE number 2087643 (Why is no real title available?)
• scientific article; zbMATH DE number 7204982 (Why is no real title available?)
• Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances

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 Q5365086)