scientific article; zbMATH DE number 1775450
From MaRDI portal
Publication:4542583
zbMath1029.68541MaRDI QIDQ4542583
Publication date: 1 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Sketching and Embedding are Equivalent for Norms, On Locality-Sensitive Orderings and Their Applications, Randomized numerical linear algebra: Foundations and algorithms, A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs, A localized meshless approach for modeling spatial-temporal calcium dynamics in ventricular myocytes, An elementary proof of a theorem of Johnson and Lindenstrauss, An acceleration of FFT-based algorithms for the match-count problem, New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions, Manifold Learning and Nonlinear Homogenization, The Distortion of Locality Sensitive Hashing, Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?, I/O-Efficient Similarity Join, Unnamed Item, Compressive Gaussian Mixture Estimation, Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering, Habituation as a neural algorithm for online odor discrimination, The Closest Pair Problem under the Hamming Metric, Unifying Online and Offline Preference for Social Link Prediction, Syndrome Decoding Estimator, 3D Rectangulations and Geometric Matrix Multiplication, Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny), Proximity-preserving labeling schemes, Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing, Lattice Sieving via Quantum Random Walks, Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions, On the approximation of Euclidean SL via geometric method, Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification, On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions, On Clustering Induced Voronoi Diagrams, Randomized algorithms in numerical linear algebra, Nearly optimal property preserving hashing, Secure sampling with sublinear communication, Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric, Unnamed Item, Unnamed Item, Representation and coding of signal geometry, On variants of the Johnson–Lindenstrauss lemma, Visual Categorization with Random Projection, Efficient Associative Computation with Discrete Synapses, Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data, Lattice-based locality sensitive hashing is optimal, Constructing a High-Dimensional k NN-Graph Using a Z-Order Curve, On the Distortion of Locality Sensitive Hashing, Statistical mechanics of complex neural systems and high dimensional data, Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1, On Locality-Sensitive Orderings and Their Applications, Combinatorial theorems about embedding trees on the real line, Limitations on Quantum Dimensionality Reduction, Content Search through Comparisons, Learning Binary Hash Codes for Large-Scale Image Search, Partitioning Well-Clustered Graphs: Spectral Clustering Works!, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Random Projection RBF Nets for Multidimensional Density Estimation, Unnamed Item, Unnamed Item, Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions, Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem, Learning in compressed space, Cell-probe lower bounds for the partial match problem, Fast and RIP-optimal transforms, Biomechanical simulation and control of hands and tendinous systems, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees, CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction*, Unnamed Item, Unnamed Item, A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee, Unnamed Item, Theoretical analysis of cross-validation for estimating the risk of the k-Nearest Neighbor classifier, Optimal Bounds for Johnson-Lindenstrauss Transformations, A survey on unsupervised outlier detection in high‐dimensional numerical data, The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics, Locality-Sensitive Hashing Without False Negatives for $$l_p$$, Frequent-Itemset Mining Using Locality-Sensitive Hashing, Almost Optimal Explicit Johnson-Lindenstrauss Families, Unnamed Item, Johnson-Lindenstrauss lemma for circulant matrices**, Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation, The parallelism motifs of genomic data analysis, An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems, Approximating Minimization Diagrams and Generalized Proximity Search, Unnamed Item, Computing (and Life) Is All about Tradeoffs, Beta Random Projection, Estimating Leverage Scores via Rank Revealing Methods and Randomization, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Conservative confidence intervals on multiple correlation coefficient for high-dimensional elliptical data using random projection methodology, The black-box complexity of nearest-neighbor search, Unnamed Item, Unnamed Item, Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}., Local Density Estimation in High Dimensions, Random projections and Hotelling’s T2 statistics for change detection in high-dimensional data streams, A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique, Approximate distance-comparison-preserving symmetric encryption, \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\), VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search, Event detection in online social network: methodologies, state-of-art, and evolution, Binary vectors for fast distance and similarity estimation, Improved maximum inner product search with better theoretical guarantee using randomized partition trees, Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance, Unique entity estimation with application to the Syrian conflict, A strong lower bound for approximate nearest neighbor searching, Efficient binary embedding of categorical data using BinSketch, Sequence graph transform (SGT): a feature embedding function for sequence data mining, Approximate maximum weight branchings, Similarity based deduplication with small data chunks, Approximation and inapproximability results for maximum clique of disc graphs in high dimensions, The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite, Exploiting pseudo-locality of interchange distance, Locality sensitive hashing with extended differential privacy, How to find ternary LWE keys using locality sensitive hashing, An algorithmic theory of learning: robust concepts and random projection, Kernels as features: on kernels, margins, and low-dimensional mappings, Fast spectral analysis for approximate nearest neighbor search, Property-preserving hash functions for Hamming distance from standard assumptions, I/O-efficient similarity join, On the distance concentration awareness of certain data reduction techniques, Dense neighborhoods on affinity graph, Vector data transformation using random binary matrices, A simple test for zero multiple correlation coefficient in high-dimensional normal data using random projection, A new coding-based algorithm for finding closest pair of vectors, Coding of image feature descriptors for distributed rate-efficient visual correspondences, Distance geometry and data science, Multiple feature kernel hashing for large-scale visual search, Database-friendly random projections: Johnson-Lindenstrauss with binary coins., Iterative denoising, Random projections for quadratic programs, Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis, A variant of the Johnson-Lindenstrauss lemma for circulant matrices, Dense fast random projections and Lean Walsh transforms, Sieving for closest lattice vectors (with preprocessing), Set-based approximate approach for lossless graph summarization, Robust proximity search for balls using sublinear space, Decomposable algorithms for nearest neighbor computing, Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions, Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time, Compressed labeling on distilled labelsets for multi-label learning, Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma, The complexity of LSH feasibility, Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings, Indexability, concentration, and VC theory, Health policyholder clustering using medical consumption. A useful tool for targeting prevention plans, On closest pair in Euclidean metric: monochromatic is as hard as bichromatic, Nonparametric link prediction in large scale dynamic networks, Identifying an unknown code by partial Gaussian elimination, Approximate range searching in higher dimension, Improved linear embeddings via Lagrange duality, SONIC: streaming overlapping community detection, Multiple Bayesian discriminant functions for high-dimensional massive data classification, Group nearest-neighbor queries in the \(L_1\) plane, On metric properties of maps between Hamming spaces and related graph homomorphisms, Real-valued embeddings and sketches for fast distance and similarity estimation, Dimensionality reduction with subgaussian matrices: a unified theory, Why locality sensitive hashing works: a practical perspective, Lower bounds for predecessor searching in the cell probe model, De-anonymization of heterogeneous random graphs in quasilinear time, Probably correct \(k\)-nearest neighbor search in high dimensions, Randomized large distortion dimension reduction, Vector representations for efficient comparison and search for similar strings, Permuted pattern matching algorithms on multi-track strings, Two-dimensional random projection, Tighter lower bounds for nearest neighbor search and related problems in the cell probe model, Diffusion wavelets, An algorithmic theory of learning: Robust concepts and random projection, On recovery guarantees for one-bit compressed sensing on manifolds, GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions, SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search, A distance based clustering method for arbitrary shaped clusters in large datasets, Viewpoint independent object recognition in cluttered scenes exploiting ray-triangle intersection and SIFT algorithms, Nearest neighbour group-based classification, Deformable spanners and applications, An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN, A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries, Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering, Index-based, high-dimensional, cosine threshold querying with optimality guarantees, Geometric component analysis and its applications to data analysis, ForestDSH: a universal hash design for discrete probability distributions, Correlations between random projections and the bivariate normal, Generalised kernel weighted fuzzy c-means clustering algorithm with local information, Investigation of accelerated search for close text sequences with the help of vector representations, Consensus hashing, Weakly-supervised semantic guided hashing for social image retrieval, Anchor-based self-ensembling for semi-supervised deep pairwise hashing, Robust property-preserving hash functions for Hamming distance and more, Bayesian random projection-based signal detection for Gaussian scale space random fields, An asymptotic thin shell condition and large deviations for random multidimensional projections, A simple proof of the restricted isometry property for random matrices, Fast dimension reduction using Rademacher series on dual BCH codes, Faster compression methods for a weighted graph using locality sensitive hashing, Sampling hyperspheres via extreme value theory: implications for measuring attractor dimensions, Sharing hash codes for multiple purposes, A non-gradient method for solving elliptic partial differential equations with deep neural networks, New analysis of manifold embeddings and signal recovery from compressive measurements, Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\), On approximate nearest neighbors under \(l_\infty\) norm, Similarity, kernels, and the fundamental constraints on cognition, Approximate hashing for bioinformatics
