1632 search results - page 13 / 327 » Sublinear Time Algorithms for Metric Space Problems |
101
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
141
click to vote
IPL
2008
15 years 2 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
129
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
132
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
125
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...