A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
From MaRDI portal
Publication:4575736
DOI10.1137/1.9781611974782.3zbMath1410.68106arXiv1605.02687OpenAlexW2393639016MaRDI QIDQ4575736
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/1605.02687
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)
Related Items (7)
Lower bounds on lattice sieving and information set decoding ⋮ Lattice-based locality sensitive hashing is optimal ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
