Locality-Sensitive Hashing Without False Negatives for $$l_p$$

DOI10.1007/978-3-319-42634-1_9zbMath1454.68035arXiv1611.09317OpenAlexW2478094390MaRDI QIDQ2817854

Piotr Wygocki, Karol Węgrzycki, Andrzej Pacuk, Piotr Sankowski

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

I/O-efficient similarity join ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}.

Cites Work

• Unnamed Item
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Optimal Data-Dependent Hashing for Approximate Near Neighbors
• On Khintchine inequalities with a weight
• The best constants in the Khintchine inequality
• Locality-sensitive Hashing without False Negatives
• Probability Inequalities for Sums of Bounded Random Variables
• Locality-sensitive hashing scheme based on p-stable distributions

This page was built for publication: Locality-Sensitive Hashing Without False Negatives for $$l_p$$