Similarity estimation techniques from rounding algorithms
From MaRDI portal
(Redirected from Publication:3579235)
Cited in
(84)- Shortest vector from lattice sieving: a few dimensions for free
- Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions
- Distance-based index structures for fast similarity search
- SONIC: streaming overlapping community detection
- The mixed Lipschitz space and its dual for tree metrics
- Index structures for fast similarity search for real-valued vectors. I
- High-dimensional approximate \(r\)-nets
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
- ForestDSH: a universal hash design for discrete probability distributions
- Correlations between random projections and the bivariate normal
- 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
- Isometric structure of transportation cost spaces on finite metric spaces
- Variance reduction in feature hashing using MLE and control variate method
- Efficient binary embedding of categorical data using BinSketch
- Locality sensitive hashing with extended differential privacy
- Unsupervised binary representation learning with deep variational networks
- On relations between transportation cost spaces and _1
- Dimension reduction by random hyperplane tessellations
- Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces
- Sharing hash codes for multiple purposes
- Binary vectors for fast distance and similarity estimation
- I/O-efficient similarity join
- The complexity of LSH feasibility
- Nonembeddability theorems via Fourier analysis
- Formation of similarity-reflecting binary vectors with random binary projections
- Similarity, kernels, and the fundamental constraints on cognition
- Estimating quantum speedups for lattice sieves
- Hardware-friendly compression and hardware acceleration for transformer: a survey
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- Faster sieving for shortest lattice vectors using spherical 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
- Randomized projective methods for the construction of binary sparse vector representations
- An explicit bound on the transportation cost distance
- Coding of image feature descriptors for distributed rate-efficient visual correspondences
- On binary embedding using circulant matrices
- Sketching and embedding are equivalent for norms
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time
- On the Distortion of Locality Sensitive Hashing
- The distortion of locality sensitive hashing
- Learning Binary Hash Codes for Large-Scale Image Search
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Dual‐tree fast exact max‐kernel search
- A detailed study of the distributed rough set based locality sensitive hashing feature selection technique
- PUFFINN: parameterless and universally fast finding of nearest neighbors
- Unifying Online and Offline Preference for Social Link Prediction
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Preconditioning for the Geometric Transportation Problem
- Read mapping on genome variation graphs
- An improved analysis of local search for max-sum diversification
- Hypercube LSH for approximate near neighbors
- Graph-based time-space trade-offs for approximate near neighbors
- Filtering multi-set tree: data structure for flexible matching using multi-track data
- Deep Reinforcement Learning: A State-of-the-Art Walkthrough
- LSH-preserving functions and their applications
- Local Density Estimation in High Dimensions
- Lattice Sieving via Quantum Random Walks
- Stochastic approximation of lamplighter metrics
- 𝐿₁-distortion of Wasserstein metrics: A tale of two dimensions
- Selecting Sketches for Similarity Search
- Wasserstein distance and metric trees
- VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
- Sublinear time algorithms for earth mover's distance
- Anomaly detection in dynamic networks: a survey
- Index structures for fast similarity search for binary vectors
- Polytopes, lattices, and spherical codes for the nearest neighbor problem
- Faster and space efficient indexing for locality sensitive hashing
- Parallelize single-site dynamics up to Dobrushin criterion
- Approximation algorithms for 1-Wasserstein distance between persistence diagrams
- Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing
- What relations are reliably embeddable in Euclidean space?
- Improving LSH via tensorized random projection
- Is it possible to find the single nearest neighbor of a query in high dimensions?
- Approximate similarity search under edit distance using locality-sensitive hashing
- Approximating snowflake metrics by trees
- On the Metricity of the Chatterjee Correlation Coefficient
- On the practicality of quantum sieving algorithms for the shortest vector problem
- Edit distance in near-linear time: it's a constant factor
- Consensus hashing
- Finding shortest lattice vectors faster using quantum search
- Explicit embeddings for nearest neighbor search with Mercer kernels
- Multiple feature kernel hashing for large-scale visual search
This page was built for publication: Similarity estimation techniques from rounding algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579235)
