Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search

DOI10.1137/1.9781611974782.1zbMath1410.68107arXiv1511.07357OpenAlexW2279110065MaRDI QIDQ4575733

Sepideh Mahabadi, Sariel Har-Peled

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.07357

Mathematics Subject Classification ID

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

Related Items (2)

Analysis of the Period Recovery Error Bound ⋮ Index structures for fast similarity search for binary vectors

This page was built for publication: Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search