Faster and space efficient indexing for locality sensitive hashing

DOI10.1016/J.TCS.2025.115479MaRDI QIDQ6908101zbMATH OpenFDO

Authors Bhisham Dev Verma, Rameshwar Pratap

Publication date 1 November 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115479

zbMATH Keywords

tensorsrandom projectionnearest neighbor searchlocality-sensitive hashingcount sketchsigned random projection

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 1775418 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Econometric analysis of cross section and panel data.
• Finding frequent items in data streams
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Improving Random Projections Using Marginal Information
• Locality-sensitive hashing scheme based on p-stable distributions
• Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
• Similarity estimation techniques from rounding algorithms

This page was built for publication: Faster and space efficient indexing for locality sensitive hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908101)