1632 search results - page 3 / 327 » Sublinear Time Algorithms for Metric Space Problems |
78
Voted
COCO
2007
Springer
15 years 3 months ago
2007
Springer
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
FOCM
2010
14 years 8 months ago
2010
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...