Algorithmic applications of low-distortion geometric embeddings

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 10-33

  Indyk, P ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; FAST FOURIER TRANSFORMS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

LOW-DISTORTION EMBEDDINGS;

COMPUTATION THEORY;

EID: 0035162484     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959878     Document Type: Conference Paper

References (86)

1. Buy-at-bulk network design
2. Database-friendly random projections
3. Tracking join and self-join sizes in limited storage
4. Learning a mixture of gaussians
5. Graph-theoretic game and its applications to the k-server problem
6. The space complexity of approximating the frequency moments
7. Topology aggregation for directed graphs
8. An algorithmic theory of learning: Robust concepts and random projection
9. Probabilistic approximation of metric spaces and its algorithmic applications
10. Approximating arbitrary metrics by tree metrics
11. A polylog(n)-competitive algorithm for metrical task systems
12. Approximating min-sum k-clustering in metric spaces
13. The fourth moment method
14. Semi-definite relaxations for minimum bandwidth and other vertex ordering problems
15. On lipschitz embedding of finite metric spaces into hilbert space
16. The metrical interpretation of superreflexivity in banach spaces
17. Approximating a finite metric by a small number of tree metrics
18. Approximation algorithms for the metric labeling problem via a new linear programming formulation
19. A method for simulating stable random variables
20. Permutation editing and matching via embeddings
21. Communication complexity of document exchange
22. Deterministic restrictions in circuit complexity
23. Learning mixtures of gaussians
24. Experiments with random projection
25. An elementary proof of the Johnson-lindenstrauss lemma
26. Metric entropy of some classes of sets with differentiable boundaries
27. A theorem on convex bodies and applications to banach spaces
28. Deterministic dimensionality reduction with applications
29. Extremal problems in graph theory
30. Approximate nearest neighbor algorithms for hausdorff metrics via embeddings
31. Approximating the bandwidth via volume respecting embeddings
32. An approximate l1-difference algorithm for massive data streams
33. The dimension of almost spherical sections of convex bodies
34. The Johnson-lindenstrauss lemma and the sphericity of some graphs
35. Better algorithms for unfair metrical task systems and applications
36. On computing the diameter of a point set in high dimensional euclidean space
37. An approximate lp-difference algorithm for massive data streams
38. Efficient maintenance of histograms
39. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries
40. A polylogarithmic approximation algorithm for the group steiner tree problem
41. Cuts, trees and l1 embeddings
42. Distance labeling in graphs
43. Steiner nodes in trees don't (really) help
44. Scalable techniques for clustering the web
45. A replacement for voronoi diagrams of near linear size
46. When crossings count - Approximating the minimum spanning tree
47. Competitive concurrent distributed queueing
48. Identifying representative trends in massive time series datasets using sketches
49. Approximate nearest neighbor: Towards removing the curse of dimensionality
50. Faster algorithms for string matching problems: Matching the convolution bound
51. ∞ norm
52. Dimensionality reduction techniques for proximity problems
53. Stable distributions, pseudorandom generators, embeddings and data stream computation
54. Better algorithms for high-dimensional proximity problems via asymmetric embeddings
55. Optimal histograms with quality guarantees
56. n
57. Dimensionality reduction by random mapping: Fast similarity computation for clustering
58. Efficient search for approximate nearest neighbor in high dimensional spaces
59. Placement algorithms for hierarchical cooperative caching
60. An approximation algorithm for the covering steiner problem
61. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields
62. The geometry of graphs and some of its algorithmic applications
63. Global self organization of all known protein sequences reveals inherent biological signatures
64. Local theory of normed spaces and convexity
65. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
66. Geometric representations of graphs
67. On the distortion required for embedding finite metric spaces into normed spaces
68. On embedding trees into uniformly convex banach spaces
69. Approximate nearest neighbours and sequence comparison with block operations
70. Wavelet-based histograms for selectivity estimation
71. Polynomial time approximation schemes for geometric k-clustering
72. Proximity-preserving labeling schemes for graphs
73. Finding near optimal separators in planar graphs
74. Small distortion and volume preserving embeddings for planar and euclidean metrics
75. Self-organizing semantic maps
76. Lower bounds on the distortion of embedding finite metric spaces in graphs
77. Random embeddings of euclidean spaces in sequence spaces
78. Topology aggregation for networks with hierarchical structure: A practical approach
79. When hamming meets euclid: The approximability of geometric tsp and mst
80. Approximate distance oracles
81. Random projection: A new approach to vlsi layout
82. A polynomial time approximation scheme for minimum routing cost spanning trees