论文信息 - A variant of the Johnson-Lindenstrauss lemma for circulant matrices - 字舞流文

A variant of the Johnson-Lindenstrauss lemma for circulant matrices

[1] Aicke Hinrichs,et al. Johnson‐Lindenstrauss lemma for circulant matrices* * , 2010, Random Struct. Algorithms.

[2] Bernard Chazelle,et al. The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors , 2009, SIAM J. Comput..

[3] Jirí Matousek,et al. On variants of the Johnson–Lindenstrauss lemma , 2008, Random Struct. Algorithms.

[4] Nir Ailon,et al. Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes , 2008, SODA '08.

[5] Bernard Chazelle,et al. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform , 2006, STOC '06.

[6] Dimitris Achlioptas,et al. Database-friendly random projections: Johnson-Lindenstrauss with binary coins , 2003, J. Comput. Syst. Sci..

[7] Sanjoy Dasgupta,et al. An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.

[8] P. Massart,et al. Adaptive estimation of a quadratic functional by model selection , 2000 .

[9] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[10] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .