The following pages link to A sparse Johnson (Q2875159):
Displaying 22 items.
- 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)
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- Fast binary embeddings with Gaussian circulant matrices: improved bounds (Q1991343) (← links)
- Sparse random matrices have simple spectrum (Q2028938) (← links)
- Tail bounds for gaps between eigenvalues of sparse random matrices (Q2076604) (← links)
- Variance reduction in feature hashing using MLE and control variate method (Q2102328) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Stochastic boundary methods of fundamental solutions for solving PDEs (Q2520343) (← links)
- Binary random projections with controllable sparsity patterns (Q2676161) (← links)
- Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796) (← links)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- Compressed and Penalized Linear Regression (Q3391428) (← links)
- On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
- Tracking the l_2 Norm with Constant Update Time (Q5875453) (← links)
- (Q5875521) (← links)
- Fast Metric Embedding into the Hamming Cube (Q6154196) (← links)
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)
