Dimensionality reductions in ℓ2 that preserve volumes and distance to affine spaces

Discrete and Computational Geometry

Volumn 38, Issue 1, 2007, Pages 139-153

  Magen, Avner ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34249869871     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-007-1329-4     Document Type: Article

References (18)

1. D. Achlioptas. Database-friendly random projections. In Proceedings of PODS 01, pages 274-281, 2001.
2. N. Ailon and B. Chazelle. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. In STOC '06: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pages 557-563. ACM Press, New York, 2006.
3. N. Alon. Problems and results in extremal combinatorics. Discrete Math., I(273):31-53, 2003.
4. P. Agarwal and C. Procopiuc. Approximation algortihms for strip cover in the plane. In Proceeding of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 373-382, 2000.
5. R. I. Arriaga and S. Vempala. An algorithmic theory of learning: robust concepts and random projections. In Proceeding of the 40th Annual Symposium on Foundations of Computer Science, pages 616-623, New York, 1999.
6. S. Dasgupta and Gupta A. An elementary proof of the Johnson-Lindenstrauss lemma. Technical Report TR-99-06, Computer Science Institute, Berkeley, CA, 1999.
7. L. Engebretsen, P. Indyk, and R. O'Donnell. Derandomized dimensionality reduction with applications. In Proceedings of the 13th Symposium on Discrete Algorithms, pages 705-712, 2002.
8. U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci., 60(3):510-539, 2000.
9. P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory Scr. B, 44(2):355-362, 1988.
10. S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using core-sets. In SCG '02: Proceedings of the Eighteenth Annual Symposium on Computational Geometry, pages 312-318. ACM Press, New York, 2002.
11. P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. In Proceedings of the Thirty-Second Symposium on Theory of Computing, pages 604-613, 1998.
12. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hubert space. In Proceedings of the Conference in Modern Analysis and Probability (New Haven, Conn., 1982), pages 189-206. American Mathematical Society, Providence, RI, 1984.
13. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: a new embedding method for finite metrics. Geom. Funct. Anal., 15(4):839-858, 2005.
14. N. Linial, E. London, and Yu. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
15. J.Matoušek. Lectures on Discrete Geometry. Volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
16. S. Meiser. Point location in arrangements of hyperplanes. Inform. and Comput., 106:286-303, 1993.
17. S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the Fifteenth Annual Symposium on Computational Geometry (Miami Beach, FL, 1999), pages 300-306 (electronic), New York, 1999.
18. S. Vempala. Approximating VLSI layout problems. In Proceedings of the Thirty-Ninth Symposium on Foundations of Computer Science, 1998.