Improving LSH via tensorized random projection

DOI10.1007/S00236-025-00479-XMaRDI QIDQ7025825zbMATH OpenFDO

Authors Bhisham Dev Verma, Rameshwar Pratap

Publication date 19 February 2025

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00236-025-00479-X

zbMATH Keywords

locality-sensitive hashing

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09)

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?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Locality-sensitive hashing scheme based on p-stable distributions
• Most tensor problems are NP-hard
• Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
• Similarity estimation techniques from rounding algorithms
• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions and Applications
• Tensor rank is NP-complete
• Tensor-train decomposition
• Tensors in Image Processing and Computer Vision
• The expression of a tensor or a polyadic as a sum of products.

This page was built for publication: Improving LSH via tensorized random projection

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