1099 search results - page 112 / 220 » On the Complexity of Computing Evolutionary Trees |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
100
click to vote
HIPC
2005
Springer
15 years 3 months ago
2005
Springer
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...
ICMCS
2007
IEEE
15 years 4 months ago
2007
IEEE
— A view-dependent visibility estimation technique for tree models is proposed in this work. While most previous work focused on visibility estimation of large objects in archite...
106
click to vote
IWPSE
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a method to detect and visualize evolution patterns in C++ source code. Our method consists of three steps. First, we extract an annotated syntax tree (AST) from each v...