Derandomized dimensionality reduction with applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 705-712

  Engebretsen, Lars ^a   Indyk, Piotr ^b   O'Donnell, Ryan ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING;

DERANDOMIZATION; DIMENSIONALITY REDUCTION; HIGH DIMENSIONAL SPACES; HIGH PROBABILITY; JOHNSON-LINDENSTRAUSS LEMMATA; LOW-DIMENSIONAL SPACES; PSEUDORANDOM GENERATORS; SEMI-DEFINITE PROGRAMMING;

APPROXIMATION ALGORITHMS;

EID: 36849061966     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. [AchOl] D. Achlioptas. Database-friendly random projections. Principles of Database Systems, 2001.
2. [AEH01] G. Andersson, L. Engebretsen, and J. Hastad. A new way of using semidefinite programming with applications to linear equations mod p. Journal of Algorithms, 39(2):162-204, 2001.
3. [AV99] R. I. Arriaga and S. Vempala. Algorithmic theories of learning. Foundations of Computer Science, 1999.
4. [Bar96] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. Foundations of Computer Science, 1996.
5. [Bar98] Y. Bartal. On approximating arbitrary metrices by tree metrics. Symposium on Theory of Computing, 1998.
6. [BOR99] A. Borodin, R. Ostrovsky, Y. Rabani. Sub-quadratic approximation algorithms for clustering problems in high dimensional spaces. Symposium on Theory of Computing, 1999.
7. [CCGG98J M. Charikar and C. Chekuri and A. Goel and S. Guha. Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-Median. Symposium on Theory of Computing, 1998.
8. [CCGGP98] M. Charikar and C. Chekuri and A. Goel and S. Guha and S. Plotkin. Approximating a finite metric by a small number of tree metrics. Foundations of Computer Science, 1998.
9. [Das99] S. Dasgupta. Learning mixtures of Gaussians. Foundations of Computer Science, 1999.
10. [DG99] S. Dasgupta and A. Gupta. An elementary proof of the Johnson-Lindenstrauss lemma. ICSl technical report TR-99-006, Berkeley, CA, 1999.
11. [Fel62] William Feller. An Introduction to Probability Theory and Its Applications, volume 1. John Wiley & Sons, New York, second edition, 1962.
12. [FM88] P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs Journal of Combinatorial Theory B, 44(1988), pp. 355-362.
13. [FJ97] Alan Frieze and Mark Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18:67-81, 1997.
14. [GIV01] A. Goel, P. Indyk, and K. Varadarajan. Reductions among high dimensional proximity problems. Symposium on Discrete Algorithms, 2001.
15. [MR95] S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algorithms. Foundations of Computer Science, 1995.
16. [GR94] I.S. Gradsteyn and I.M. Ryzhik. TaMe of Integrals, Series, and Products. Academic Press, Boston, fifth edition, January 1994.
17. [GW95] Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, November 1995.
18. [GW01] Michel X. Goemans and David P. Williamson. Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Symposium on Theory of Computing, 2001.
19. [IndOO] P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation Foundations of Computer Science, 2000.
20. [IKM00] P. Indyk and N. Koudas and S. Muthukrishnan. Identifying representative trends in massive time series datasets using sketches. International Conference on Very Large Databases (VLDB), 2000.
21. [IM97] Piotr Indyk and Rajeev Motwani, Approximate nearest neighbors: towards removing the curse of dimensionality. Symposium on Theory of Computing, 1997.
22. [JL84] W.B. Johnson and J. Lindenstrauss. Extensions of Lipshitz mapping into Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
23. [KMS98] David Kaxger, Rajeev Motwani and Madhu Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45(2):246-265, March 1998.
24. [KZ97] H. Karioff and U. Zwick. A 7/8-approorimation algorithm for MAX 3SAT? Foundations of Computer Science, 1997.
25. [LLR94] N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Foundations of Computer Science, pages 577-591, 1994.
26. [Nis92] Noam Nisan, Pseudorandom sequences for space bounded computations. Combinatorica, 12:449-461, 1992.
27. [PRTV00] C. Papadimitriou and P. Raghavan and H. Tamaki and S. Vempala. Latent semantic indexing: a probabilistic analysis. Symposium on the Principles of Database Systems, 1998.
28. [Wig83] Avi Wigderson. Improving the performance guarantee for approximate graph coloring. Journal of the ACM, 30:729-735, 1983.
29. [Zwi98] U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. Symposium on Discrete Algorithms, 1998