On embeddings of finite metric spaces
暂无分享,去创建一个
[1] Gábor Sági,et al. Some variants of Vaught's conjecture from the perspective of algebraic logic , 2012, Log. J. IGPL.
[2] H. Gabriela,et al. Cluster-preserving Embedding of Proteins , 1999 .
[3] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[5] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[6] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[7] Zalán Gyenis,et al. Upward Morley's theorem downward , 2013, Math. Log. Q..
[8] H. Samet. Contractive Embedding Methods for Similarity Searching in Metric Spaces , 2000 .
[9] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[10] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[11] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.