654 search results - page 19 / 131 » On the Approximation of Computing Evolutionary Trees |
75
Voted
DAC
2001
ACM
15 years 10 months ago
2001
ACM
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
BMCBI
2010
14 years 9 months ago
2010
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
97
Voted
SIBGRAPI
2008
IEEE
15 years 4 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
79
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...