Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}.

DOI10.4230/LIPIcs.ISAAC.2017.63zbMath1457.68079arXiv1708.06395OpenAlexW2964036368MaRDI QIDQ5136284

Piotr Wygocki, Piotr Sankowski

Publication date: 25 November 2020

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

zbMATH Keywords

high-dimensionalsimilarity searchlocality sensitive hashingapproximate near neighbor search

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate range searching in higher dimension
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Locality-Sensitive Hashing Without False Negatives for $$l_p$$
• Optimal Data-Dependent Hashing for Approximate Near Neighbors
• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
• Extensions of Lipschitz mappings into a Hilbert space

This page was built for publication: Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}.