324 search results - page 21 / 65 » Distance Approximating Trees: Complexity and Algorithms |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
JMM2
2007
13 years 7 months ago
2007
— In this paper, a single-ended quality measurement algorithm for noise suppressed speech is described. The proposed algorithm computes fast approximations of KullbackLeibler dis...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...