Similarity estimation techniques from rounding algorithms
From MaRDI portal
Publication:3579235
DOI10.1145/509907.509965zbMath1192.68226DBLPconf/stoc/Charikar02OpenAlexW2012833704WikidataQ59443093 ScholiaQ59443093MaRDI QIDQ3579235
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509965
Related Items (71)
Sketching and Embedding are Equivalent for Norms ⋮ Binary vectors for fast distance and similarity estimation ⋮ Efficient binary embedding of categorical data using BinSketch ⋮ The Distortion of Locality Sensitive Hashing ⋮ Hölder-Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover's distance ⋮ I/O-Efficient Similarity Join ⋮ Locality sensitive hashing with extended differential privacy ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions ⋮ Unifying Online and Offline Preference for Social Link Prediction ⋮ I/O-efficient similarity join ⋮ Randomized projective methods for the construction of binary sparse vector representations ⋮ An explicit bound on the transportation cost distance ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Explicit embeddings for nearest neighbor search with Mercer kernels ⋮ Lattice Sieving via Quantum Random Walks ⋮ Stochastic approximation of lamplighter metrics ⋮ 𝐿₁-distortion of Wasserstein metrics: A tale of two dimensions ⋮ Coding of image feature descriptors for distributed rate-efficient visual correspondences ⋮ Selecting Sketches for Similarity Search ⋮ Wasserstein distance and metric trees ⋮ An Improved Analysis of Local Search for Max-Sum Diversification ⋮ Unsupervised binary representation learning with deep variational networks ⋮ Multiple feature kernel hashing for large-scale visual search ⋮ VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search ⋮ Detecting the large entries of a sparse covariance matrix in sub-quadratic time ⋮ Sublinear time algorithms for earth mover's distance ⋮ Estimating quantum speedups for lattice sieves ⋮ On relations between transportation cost spaces and \(\ell_1\) ⋮ Hardware-friendly compression and hardware acceleration for transformer: a survey ⋮ Distance-based index structures for fast similarity search ⋮ The complexity of LSH feasibility ⋮ Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data ⋮ On the Distortion of Locality Sensitive Hashing ⋮ Deep Reinforcement Learning: A State-of-the-Art Walkthrough ⋮ SONIC: streaming overlapping community detection ⋮ The mixed Lipschitz space and its dual for tree metrics ⋮ Preconditioning for the Geometric Transportation Problem ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ High-dimensional approximate \(r\)-nets ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Index structures for fast similarity search for binary vectors ⋮ Learning Binary Hash Codes for Large-Scale Image Search ⋮ Dimension reduction by random hyperplane tessellations ⋮ Unnamed Item ⋮ Nonembeddability theorems via Fourier analysis ⋮ Unnamed Item ⋮ GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions ⋮ Approximating snowflake metrics by trees ⋮ Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ ForestDSH: a universal hash design for discrete probability distributions ⋮ Correlations between random projections and the bivariate normal ⋮ Formation of similarity-reflecting binary vectors with random binary projections ⋮ Unnamed Item ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ Unnamed Item ⋮ Consensus hashing ⋮ Dual‐tree fast exact max‐kernel search ⋮ Analysis on Laakso graphs with application to the structure of transportation cost spaces ⋮ Sparse graph based self-supervised hashing for scalable image retrieval ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Read Mapping on Genome Variation Graphs ⋮ Isometric structure of transportation cost spaces on finite metric spaces ⋮ Sharing hash codes for multiple purposes ⋮ Unnamed Item ⋮ Variance reduction in feature hashing using MLE and control variate method ⋮ Local Density Estimation in High Dimensions ⋮ A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique ⋮ Similarity, kernels, and the fundamental constraints on cognition
Uses Software
This page was built for publication: Similarity estimation techniques from rounding algorithms
