Random projection: a new approach to VLSI layout
暂无分享,去创建一个
[1] Santosh S. Vempala,et al. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems , 1998, STOC '98.
[2] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[3] Santosh S. Vempala,et al. A random sampling based algorithm for learning the intersection of half-spaces , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[4] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[5] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[6] Uriel Feige,et al. Approximating the Bandwidth via Volume Respecting Embeddings , 2000, J. Comput. Syst. Sci..
[7] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[8] Jon M. Kleinberg,et al. Two algorithms for nearest-neighbor search in high dimensions , 1997, STOC '97.
[9] Joseph Naor,et al. Divide-and-conquer approximation algorithms via spreading metrics , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[10] Uriel Feige,et al. Approximating the bandwidth via volume respecting embeddings (extended abstract) , 1998, STOC '98.
[11] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.