Pages that link to "Item:Q3579235"
From MaRDI portal
The following pages link to Similarity estimation techniques from rounding algorithms (Q3579235):
Displaying 50 items.
- Similarity, kernels, and the fundamental constraints on cognition (Q256393) (← links)
- Hölder-Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover's distance (Q305688) (← links)
- Randomized projective methods for the construction of binary sparse vector representations (Q380676) (← links)
- An explicit bound on the transportation cost distance (Q380692) (← links)
- Coding of image feature descriptors for distributed rate-efficient visual correspondences (Q409091) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- Sublinear time algorithms for earth mover's distance (Q633770) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Approximating snowflake metrics by trees (Q723016) (← links)
- Consensus hashing (Q747259) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Explicit embeddings for nearest neighbor search with Mercer kernels (Q890103) (← links)
- Multiple feature kernel hashing for large-scale visual search (Q898328) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions (Q1669061) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- SONIC: streaming overlapping community detection (Q1741254) (← links)
- The mixed Lipschitz space and its dual for tree metrics (Q1742818) (← links)
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- High-dimensional approximate \(r\)-nets (Q1987244) (← links)
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions (Q2023176) (← links)
- ForestDSH: a universal hash design for discrete probability distributions (Q2036729) (← links)
- Correlations between random projections and the bivariate normal (Q2036781) (← links)
- Analysis on Laakso graphs with application to the structure of transportation cost spaces (Q2055392) (← links)
- Sparse graph based self-supervised hashing for scalable image retrieval (Q2056318) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- Isometric structure of transportation cost spaces on finite metric spaces (Q2081200) (← links)
- Variance reduction in feature hashing using MLE and control variate method (Q2102328) (← links)
- Efficient binary embedding of categorical data using BinSketch (Q2134033) (← links)
- Locality sensitive hashing with extended differential privacy (Q2148769) (← links)
- Unsupervised binary representation learning with deep variational networks (Q2193830) (← links)
- On relations between transportation cost spaces and \(\ell_1\) (Q2207636) (← links)
- Dimension reduction by random hyperplane tessellations (Q2250053) (← links)
- Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces (Q2282287) (← links)
- Sharing hash codes for multiple purposes (Q2329853) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- I/O-efficient similarity join (Q2408174) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
- Formation of similarity-reflecting binary vectors with random binary projections (Q2515348) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Hardware-friendly compression and hardware acceleration for transformer: a survey (Q2700301) (← links)
- Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- I/O-Efficient Similarity Join (Q3452853) (← links)
- (Q4558470) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- On the Distortion of Locality Sensitive Hashing (Q4634022) (← links)
- The Distortion of Locality Sensitive Hashing (Q4638109) (← links)
