13 search results - page 2 / 3 » A Polynomial Kernel for Multicut in Trees |
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
PAKDD
2007
ACM
13 years 11 months ago
2007
ACM
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
ACID
2006
13 years 6 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
CIDM
2007
IEEE
13 years 9 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
AIIA
2007
Springer
13 years 9 months ago
2007
Springer
One of the aims of modern Bioinformatics is to discover the molecular mechanisms that rule the protein operation. This would allow us to understand the complex processes involved i...