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 (only showing first 100 items - show all)
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
This page was built for publication:
