Pages that link to "Item:Q2931418"
From MaRDI portal
The following pages link to Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (Q2931418):
Displaying 50 items.
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation (Q413911) (← links)
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis (Q418747) (← links)
- Detecting low-rank clusters via random sampling (Q425614) (← links)
- Solving LP using random projections (Q510927) (← links)
- Faster least squares approximation (Q623334) (← links)
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices (Q629700) (← links)
- Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
- Randomized interpolative decomposition of separated representations (Q728743) (← links)
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
- A fast randomized algorithm for the approximation of matrices (Q952399) (← links)
- The Mailman algorithm: a note on matrix-vector multiplication (Q976066) (← links)
- Random projections for the nonnegative least-squares problem (Q1030739) (← links)
- Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
- On principal components regression, random projections, and column subsampling (Q1616329) (← links)
- On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints (Q1660636) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Geometric component analysis and its applications to data analysis (Q2036489) (← links)
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Random projections for quadratic programs (Q2196316) (← links)
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions (Q2353006) (← links)
- The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite (Q2380779) (← links)
- Interpolation of Inverse Operators for Preconditioning Parameter-Dependent Equations (Q2800437) (← links)
- Random projections and Hotelling’s T2 statistics for change detection in high-dimensional data streams (Q2872879) (← links)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
- Johnson-Lindenstrauss lemma for circulant matrices** (Q3094609) (← links)
- Randomized Local Model Order Reduction (Q3174769) (← links)
- Classification Scheme for Binary Data with Extensions (Q3296178) (← links)
- Compressed and Penalized Linear Regression (Q3391428) (← links)
- On variants of the Johnson–Lindenstrauss lemma (Q3522833) (← links)
- Random Projection RBF Nets for Multidimensional Density Estimation (Q3601357) (← links)
- Dimension reduction for hyperbolic space (Q3605026) (← links)
- (Q4558470) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- Simple Classification using Binary Data (Q4614095) (← links)
- Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
- (Q4633051) (← links)
- (Q4633059) (← links)
- A Practical Randomized CP Tensor Decomposition (Q4643335) (← links)
- Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- Tensor-Structured Sketching for Constrained Least Squares (Q5021024) (← links)
- Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering (Q5067443) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- (Q5743469) (← links)
- Johnson–Lindenstrauss Embeddings with Kronecker Structure (Q5885797) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Principled interpolation of Green's functions learned from data (Q6101898) (← links)
- On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary (Q6151027) (← links)
