Sparser Johnson-Lindenstrauss transforms
From MaRDI portal
Publication:5743469
Recommendations
Cites work
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 6876120 (Why is no real title available?)
- scientific article; zbMATH DE number 2109363 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- A sparse Johnson-Lindenstrauss transform
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- An algorithmic theory of learning: Robust concepts and random projection
- An almost optimal unrestricted fast Johnson-Lindenstrauss transform
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Extensions of Lipschitz mappings into a Hilbert space
- Fast dimension reduction using Rademacher series on dual BCH codes
- Fast moment estimation in data streams in optimal space
- Finding frequent items in data streams
- Johnson-Lindenstrauss lemma for circulant matrices
- Modern computer algebra
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Numerical linear algebra in the streaming model
- On variants of the Johnson–Lindenstrauss lemma
- Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
- Tabulation based 4-universal hashing with applications to second moment estimation
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Universal classes of hash functions
Cited in
(20)- Sparser Johnson-Lindenstrauss transforms
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error
- Nearly tight oblivious subspace embeddings by trace inequalities
- A sparse Johnson-Lindenstrauss transform
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- An almost optimal unrestricted fast Johnson-Lindenstrauss transform
- New bounds for circulant Johnson-Lindenstrauss embeddings
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Simple analyses of the sparse Johnson-Lindenstrauss transform
- Johnson–Lindenstrauss Embeddings with Kronecker Structure
- The Johnson-Lindenstrauss Transform: An Empirical Study
- Fast, deterministic and sparse dimensionality reduction
- An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
- Sparsity lower bounds for dimensionality reducing maps
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Johnson-Lindenstrauss lemma for circulant matrices
- Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
- scientific article; zbMATH DE number 7650128 (Why is no real title available?)
This page was built for publication: Sparser Johnson-Lindenstrauss transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743469)
