1632 search results - page 58 / 327 » Sublinear Time Algorithms for Metric Space Problems |
124
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
146
click to vote
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
133
click to vote
CIARP
2009
Springer
15 years 6 months ago
2009
Springer
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
167
Voted
ICALP
1991
Springer
15 years 7 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
120
Voted
IJCAI
2007
15 years 4 months ago
2007
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...