scientific article; zbMATH DE number 1775450
From MaRDI portal
Publication:4542583
Recommendations
- scientific article; zbMATH DE number 437552
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- scientific article; zbMATH DE number 1559575
- Approximate nearest neighbor: towards removing the curse of dimensionality
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Cited in
(only showing first 100 items - show all)- Fast spectral analysis for approximate nearest neighbor search
- Reductions among high dimensional proximity problems
- Similarity, kernels, and the fundamental constraints on cognition
- Low-quality dimension reduction and high-dimensional approximate nearest neighbor
- A simple proof of the restricted isometry property for random matrices
- Fast dimension reduction using Rademacher series on dual BCH codes
- On variants of the Johnson–Lindenstrauss lemma
- Fast sketch-based recovery of correlation outliers
- Unifying Online and Offline Preference for Social Link Prediction
- Syndrome Decoding Estimator
- Secure approximate nearest neighbor search with locality-sensitive hashing
- Approximate nearest neighbor: towards removing the curse of dimensionality
- Nearest-neighbor-preserving embeddings
- Identifying an unknown code by partial Gaussian elimination
- Two-dimensional random projection
- Probably correct \(k\)-nearest neighbor search in high dimensions
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- On binary embedding using circulant matrices
- scientific article; zbMATH DE number 7561471 (Why is no real title available?)
- Sharing hash codes for multiple purposes
- Approximate distance-comparison-preserving symmetric encryption
- On approximate nearest neighbors under \(l_\infty\) norm
- The complexity of LSH feasibility
- Coding of image feature descriptors for distributed rate-efficient visual correspondences
- Randomized embeddings with slack and high-dimensional approximate nearest neighbor
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)
- Dimensionality reduction with subgaussian matrices: a unified theory
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- Solving, tracking and stopping streaming linear inverse problems
- \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\)
- scientific article; zbMATH DE number 1947041 (Why is no real title available?)
- A strong lower bound for approximate nearest neighbor searching
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Kernels as features: on kernels, margins, and low-dimensional mappings
- SONIC: streaming overlapping community detection
- Cell-probe lower bounds for the partial match problem
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
- Permuted pattern matching algorithms on multi-track strings
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Filtering multi-set tree: data structure for flexible matching using multi-track data
- Approximate hashing for bioinformatics
- Nearest neighbor sampling of point sets using rays
- Sequence graph transform (SGT): a feature embedding function for sequence data mining
- Approximate maximum weight branchings
- Sieving for closest lattice vectors (with preprocessing)
- Lattice Sieving via Quantum Random Walks
- scientific article; zbMATH DE number 7204982 (Why is no real title available?)
- scientific article; zbMATH DE number 7650079 (Why is no real title available?)
- Chromatic nearest neighbor searching: A query sensitive approach
- Visual categorization with random projection
- Conservative confidence intervals on multiple correlation coefficient for high-dimensional elliptical data using random projection methodology
- Improved maximum inner product search with better theoretical guarantee using randomized partition trees
- Unique entity estimation with application to the Syrian conflict
- Diffusion wavelets
- Randomized numerical linear algebra: Foundations and algorithms
- scientific article; zbMATH DE number 1445324 (Why is no real title available?)
- Reporting neighbors in high-dimensional Euclidean space
- Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
- Random projections for linear programming: an improved retrieval phase
- Approximate \(k\)-flat nearest neighbor search
- An algorithmic theory of learning: robust concepts and random projection
- The \(xyz\) algorithm for fast interaction search in high-dimensional data
- Frequent-itemset mining using locality-sensitive hashing
- Automata, Languages and Programming
- Database Theory - ICDT 2005
- Random projections for quadratic programs
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
- scientific article; zbMATH DE number 437552 (Why is no real title available?)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- Robust property-preserving hash functions for Hamming distance and more
- Biomechanical simulation and control of hands and tendinous systems
- On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
- Proximity in the age of distraction: robust approximate nearest neighbor search
- scientific article; zbMATH DE number 1559575 (Why is no real title available?)
- scientific article; zbMATH DE number 1775451 (Why is no real title available?)
- Efficient Associative Computation with Discrete Synapses
- Event detection in online social network: methodologies, state-of-art, and evolution
- Fast cross-polytope locality-sensitive hashing
- The distortion of locality sensitive hashing
- Randomized large distortion dimension reduction
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- Hypercube LSH for approximate near neighbors
- Viewpoint independent object recognition in cluttered scenes exploiting ray-triangle intersection and SIFT algorithms
- Nearest neighbour group-based classification
- Fast algorithm for recovering the true solution with fixed weight of a system of linear Boolean equations with noised right-hand side
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Property-preserving hash functions for Hamming distance from standard assumptions
- Proximity-preserving labeling schemes
- Why locality sensitive hashing works: a practical perspective
- Decomposable algorithms for nearest neighbor computing
- De-anonymization of heterogeneous random graphs in quasilinear time
- Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
- Reporting neighbors in high-dimensional Euclidean space
- Binary vectors for fast distance and similarity estimation
- An acceleration of FFT-based algorithms for the match-count problem
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- The parallelism motifs of genomic data analysis
- Local Density Estimation in High Dimensions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542583)
