4095 search results - page 15 / 819 » How to test a tree |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
IVA
2010
Springer
13 years 6 months ago
2010
Springer
A smile may communicate different meanings depending on subtle characteristics of the facial expression. In this article, we have studied the morphological and dynamic characteris...
DSS
2011
12 years 11 months ago
2011
In the current paper, we outline several approaches to determine the value of information system (IS) flexibility, defined as the extent to which an IS can be modified and upgrade...
BMCBI
2007
13 years 7 months ago
2007
Background: Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first ...
JCO
2006
13 years 7 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...