LSH Forest: Practical Algorithms Made Theoretical
From MaRDI portal
Publication:4575739
DOI10.1137/1.9781611974782.5zbMath1410.68092OpenAlexW4237307902MaRDI QIDQ4575739
Ilya Razenshteyn, Negev Shekel Nosatzki, Alexandr Andoni
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://doi.org/10.1137/1.9781611974782.5
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)
Related Items (4)
Index structures for fast similarity search for real-valued vectors. I ⋮ Index structures for fast similarity search for binary vectors ⋮ Index structures for fast similarity search for symbol strings ⋮ Unnamed Item
This page was built for publication: LSH Forest: Practical Algorithms Made Theoretical