Embeddings of surfaces, curves, and moving points in euclidean space

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 381-389

  Agarwal, Pankaj K ^a   Har Peled, Sariel ^b   Yu, Hai ^a  

^a Duke University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Dimensionality reduction; Doubling dimension; Moving points; Random projection

Indexed keywords

EMBEDDED SYSTEMS; ERROR ANALYSIS; GRAPH THEORY; POLYNOMIALS;

DIMENSIONALITY REDUCTION; DOUBLING DIMENSION; MOVING POINTS; RANDOM PROJECTION;

SURFACE ANALYSIS;

EID: 35348892607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247135     Document Type: Conference Paper

References (32)

1. I. Abraham, Y. Bartal, and O. Neimany, Advances in metric embedding theory, Proc. 38th Annu. ACM Sympos. Theory Comput., 2006, pp. 271-286.
2. D. Achlioptas, Database-friendly random projections, Proc. 20th ACM Sympos. Principles Database Syst., 2001, pp. 274-281.
3. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, Approximating extent measures of points, J. Assoc. Comput. Mach., 51 (2004), 606-635.
4. P. K. Agarwal and J. Matoušek, On range searching with semialgebraic sets, Discrete Comput. Geom., 11 (1994), 393-418.
5. N. Alon, Problems and results in extremal combinatorics I, Discrete Math., 273 (2003), 31-53.
6. R. Arriaga and S. Vempala, An algorithmic theory of learning: robust concepts and random projection, Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci., 1999, pp. 616-623.
7. R. Baraniuk and M. Wakin, Random projections of smooth manifolds, Proc. IEEE Intl. Conf. Acoustics, Speech and Signal Processing, 2006, pp. 941-944.
8. M. Baumann and U. Helmke, Singular value decomposition of time-varying matrices, Future Gen. Comp. Sys., 19 (2003), 353-361.
9. M. Belkin and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Computation, 15(6) (2003), 1373-1396.
10. E. Bingham and H. Mannila, Random projection in dimensionality reduction: applications to image and text data, Proc. 7th ACM SIGKDD Intl. Conf. Knowl Disc. Data Mining, 2001, pp. 245-250.
11. J. Bourgain, On Lipschitz embedding of finite metric spaces in Hubert space, Israel J. Math., 52 (1985), 46-52.
12. M. Bǎdoiu and K. Clarkson, Smaller coresets for balls, Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, 2003, pp. 801-802.
13. S. Dasgupta, Learning mixtures of Gaussians, Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci., 1999, pp. 634-644.
14. S. Dasgupta and A. Gupta, An elementary proof of a theorem of Johnson and Lindenstrauss, Rand. Struct. Alg., 22 (2003), 60-65.
15. L. Dieci and T. Eirola, On smooth decompositions of matrices, SIAM J. Matrix Anal. Appl., 20 (1999), 800-819.
16. P. Prankl and H. Maehara, The Johnson-Lindenstrauss lemma and the sphericity of some graphs, J. Comb. Theory B, 44 (1988), 355-362.
17. A. Goel, P. Indyk, and K. R. Varadarajan, Reductions among high dimensional proximity problems, Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 769-778.
18. P. Hall, D. Poskitt, and B. Presnell, A functional data-analytic approach to signal discrimination, Technometrics, 43(1) (2001), 1-9.
19. P. Indyk, Algorithmic applications of low-distortion geometric embeddings, Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., 2001, pp. 10-31.
20. P. Indyk and J. Matoušek, Low-distortion embeddings of finite metric spaces, in: Handbook of Discrete and Computational Geometry (J. Goodman and J. O'Rourke, eds.), CRC Press, 2004, pp. 177-196.
21. P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, Proc. 30th Annu. ACM Sympos. Theory Comput., 1998, pp. 604-613.
22. P. Indyk and A. Naor, Nearest neighbor preserving embeddings, ACM Trans. Algorithms, (to appear).
23. W. B. Johnson and J. Lindenstrauss, Extensions of Lipschitz mapping into Hubert space, Contemporary Mathematics, 26 (1984), 189-206.
24. J. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, Proc. 29th Annu. ACM Sympos. Theory Comput., 1997, pp. 599-608.
25. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces, SIAM J. Comput., 2 (2000), 457-474.
26. N. Linial, Finite metric spaces - combinatorics, geometry and algorithms, Proc. Int. Cong. Math. III, 2002, pp. 573-586.
27. N. Linial, E. London, and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15(2) (1995), 215-245.
28. A. Magen, Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applicar tions, The 6th Intl. Work. Rand. Appr. Tech. Comp. Sci., 2002, pp. 239-253.
29. J. Matoušek, Lectures on Discrete Geometry, Springer-Verlag, NY, 2002.
30. L. Santalo, Introduction to Integral Geometry, Paris, Hermann, 1953.
31. T. Sarlós, Improved approximation algorithms for large matrices via random projections, Proc. 47th Annu. IEEE Sympos. Found. Comput Sci., 2006, pp. 143-152.
32. S. Vempala, The Random Projection Method, American Mathematical Society, 2004.