Sparsifying and Derandomizing the Johnson-Lindenstrauss Transform
Presenter
January 31, 2011
Keywords:
- Computer Science and Discrete Mathematics (CSDM)
Abstract
The Johnson-Lindenstrauss lemma states that for any n points in Euclidean space and error parameter 0