427 search results - page 21 / 86 » Computing the Local Consensus of Trees |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
ICPR
2010
IEEE
14 years 7 months ago
2010
IEEE
Reducing the dimension of local descriptors in images is useful to perform pixels comparison faster. We show here that, for enhancing and optimising the computation of the NL-mean...
RECOMB
2008
Springer
15 years 9 months ago
2008
Springer
High-accuracy protein structure modeling demands accurate and very fast side chain prediction since such a procedure must be repeatedly called at each step of structure refinement....
RECOMB
1997
Springer
15 years 1 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...