Pages that link to "Item:Q5189547"
From MaRDI portal
The following pages link to The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors (Q5189547):
Displaying 29 items.
- Random design analysis of ridge regression (Q404306) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- Compressed sensing with coherent and redundant dictionaries (Q544040) (← links)
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices (Q629700) (← links)
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma (Q639988) (← links)
- User-friendly tail bounds for sums of random matrices (Q695625) (← links)
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
- Matrix sketching for supervised classification with imbalanced classes (Q832649) (← links)
- (Q4638108) (← links)
- On Geometric Prototype and Applications (Q5009580) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
- Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 (Q5875504) (← links)
- PLSS: A Projected Linear Systems Solver (Q6039256) (← links)
- Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification (Q6062237) (← links)
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
- Principled interpolation of Green's functions learned from data (Q6101898) (← links)
- Generalized linear models for massive data via doubly-sketching (Q6117016) (← links)
- Norms of structured random matrices (Q6130287) (← links)
- Lipschitz geometry of operator spaces and Lipschitz-free operator spaces (Q6144267) (← links)
- \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\) (Q6145674) (← links)
- Fast Metric Embedding into the Hamming Cube (Q6154196) (← links)
- On randomized sketching algorithms and the Tracy-Widom law (Q6163409) (← links)
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition (Q6202283) (← links)
- Constructing low-rank Tucker tensor approximations using generalized completion (Q6489425) (← links)