The Distortion of Locality Sensitive Hashing

DOI10.4230/LIPIcs.ITCS.2017.54zbMath1402.68185OpenAlexW2772711833MaRDI QIDQ4638109

Erisa Terolli, Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi

Publication date: 3 May 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.ITCS.2017.54

zbMATH Keywords

similaritydistortionlocality sensitive hashing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General topics in the theory of data (68P01)

Related Items (1)

Index structures for fast similarity search for real-valued vectors. I

Cites Work

• Non-trivial intersecting families
• Min-wise independent permutations
• The complexity of LSH feasibility
• Image steganalysis with binary similarity measures
• LSH-Preserving Functions and Their Applications
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Similarity estimation techniques from rounding algorithms
• Efficient algorithms for substring near neighbor problem
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
• Quantum information theory
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Successive refinement of information
• Encyclopedia of Distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Distortion of Locality Sensitive Hashing