Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with johnson-lindenstrauss:
TR10-183 | 29th November 2010
Raghu Meka

Almost Optimal Explicit Johnson-Lindenstrauss Transformations

Revisions: 2

The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in the design and analysis of algorithms in high dimensional geometry. Most known constructions of linear embeddings that satisfy the Johnson-Lindenstrauss property involve randomness. We address the question of explicitly constructing such embedding families and provide a construction ... more >>>

ISSN 1433-8092 | Imprint