The distortion of locality sensitive hashing
From MaRDI portal
Recommendations
Cites work
- Efficient algorithms for substring near neighbor problem
- Encyclopedia of Distances
- Global text matching for information retrieval
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 1559577 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 1869496 (Why is no real title available?)
- Image steganalysis with binary similarity measures
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- LSH-preserving functions and their applications
- Min-wise independent permutations
- Non-trivial intersecting families
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Quantum information theory
- Similarity estimation techniques from rounding algorithms
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Successive refinement of information
- The complexity of LSH feasibility
Cited in
(10)- Index structures for fast similarity search for real-valued vectors. I
- Exploiting pseudo-locality of interchange distance
- Locality sensitive hashing with extended differential privacy
- Sharing hash codes for multiple purposes
- The complexity of LSH feasibility
- Locality-Sensitive Hashing Without False Negatives for l_p
- LSH-preserving functions and their applications
- Lower Bounds on Locality Sensitive Hashing
- On the Distortion of Locality Sensitive Hashing
- LSH-preserving functions and their applications
This page was built for publication: The distortion of locality sensitive hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638109)