scientific article; zbMATH DE number 7053346
From MaRDI portal
Publication:5743469
zbMath1423.68213MaRDI QIDQ5743469
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095210
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Random matrices (probabilistic aspects) (60B20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Fast dimension reduction using Rademacher series on dual BCH codes
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Universal classes of hash functions
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Finding frequent items in data streams
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- An algorithmic theory of learning: Robust concepts and random projection
- A sparse Johnson
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- Johnson-Lindenstrauss lemma for circulant matrices**
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Extensions of Lipschitz mappings into a Hilbert space
- On variants of the Johnson–Lindenstrauss lemma
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Numerical linear algebra in the streaming model
- Fast moment estimation in data streams in optimal space
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
