Almost optimal explicit Johnson-Lindenstrauss families

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6845 LNCS, Issue , 2011, Pages 628-639

  Kane, Daniel ^a   Meka, Raghu ^b   Nelson, Jelani ^c  

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; DESIGN AND ANALYSIS OF ALGORITHMS; ELEMENTARY PROOF; EMBEDDING DIMENSIONS; EMBEDDINGS; EXPLICIT CONSTRUCTIONS; JOHNSON-LINDENSTRAUSS LEMMATA; LOWER BOUNDS; OPTIMALITY; RANDOM BITS;

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES;

APPROXIMATION ALGORITHMS;

EID: 80052383592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22935-0_53     Document Type: Conference Paper

References (15)

1. Ailon, N., Chazelle, B.: The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39(1), 302-322 (2009)
2. Achlioptas, D.: Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671-687 (2003)
3. Alon, N., Matias, Y., Szegedy, M.: The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci. 58(1), 137-147 (1999)
4. Arriaga, R.I., Vempala, S.: An algorithmic theory of learning: Robust concepts and random projection. Machine Learning 63(2), 161-182 (2006)
5. Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: STOC, pp. 205-214 (2009)
6. Dasgupta, S., Gupta, A.: An elementary proof of a theorem of johnson and lindenstrauss. Random Struct. Algorithms 22(1), 60-65 (2003)
7. Engebretsen, L., Indyk, P., O'Donnell, R.: Derandomized dimensionality reduction with applications. In: SODA, pp. 705-712 (2002)
8. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604-613 (1998)
9. Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26, 189-206 (1984)
10. Jayram, T.S., Woodruff, D.P.: Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with low error. In: SODA, pp. 1-10 (2011)
11. Karnin, Z., Rabani, Y., Shpilka, A.: Explicit dimension reduction and its applications. In: CCC, pp. 262-272 (2011)
12. Ledoux, M., Talagrand, M.: Probability in Banach spaces: isoperimetry and processes. Springer, Heidelberg (1991)
13. Matousek, J.: On variants of the Johnson-Lindenstrauss lemma. Random Struct. Algorithms 33(2), 142-156 (2008)
14. Sivakumar, D.: Algorithmic derandomization via complexity theory. In: STOC, pp. 619-626 (2002)
15. Zuckerman, D.: Randomness-optimal oblivious sampling. Random Struct. Algorithms 11(4), 345-367 (1997)