Beyond Locality-Sensitive Hashing

DOI10.1137/1.9781611973402.76zbMath1422.68042arXiv1306.1547OpenAlexW2952460245MaRDI QIDQ5384038

No author found.

Publication date: 20 June 2019

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (17)

Lower bounds on lattice sieving and information set decoding ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Fast spectral analysis for approximate nearest neighbor search ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Lattice Sieving via Quantum Random Walks ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ Lattice-based locality sensitive hashing is optimal ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Beyond Locality-Sensitive Hashing