A variant of the Johnson–Lindenstrauss lemma for circulant matrices
Author:
- 1 February 2011
- journal article
- Published by Elsevier in Journal of Functional Analysis
- Vol. 260 (4) , 1096-1105
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Austrian Science Fund
This publication has 8 references indexed in Scilit:
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest NeighborsSIAM Journal on Computing, 2009
- Fast Dimension Reduction Using Rademacher Series on Dual BCH CodesDiscrete & Computational Geometry, 2008
- On variants of the Johnson–Lindenstrauss lemmaRandom Structures & Algorithms, 2008
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform2006
- Database-friendly random projections: Johnson-Lindenstrauss with binary coinsJournal of Computer and System Sciences, 2003
- An elementary proof of a theorem of Johnson and LindenstraussRandom Structures & Algorithms, 2002
- Adaptive estimation of a quadratic functional by model selectionThe Annals of Statistics, 2000
- Approximate nearest neighbors1998