Sciweavers

1199 search results - page 75 / 240
» Robust inference of trees
Sort
View
157
Voted
ISBRA
2010
Springer
15 years 11 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
BILDMED
2006
169views Algorithms» more  BILDMED 2006»
15 years 5 months ago
Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
Karsten Rink, Arne-Michael Törsel, Klaus D. T...
132
Voted
VLDB
2005
ACM
139views Database» more  VLDB 2005»
15 years 9 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
158
Voted
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
15 years 10 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
ICMLA
2008
15 years 5 months ago
Decision Tree Ensemble: Small Heterogeneous Is Better Than Large Homogeneous
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
Michael Gashler, Christophe G. Giraud-Carrier, Ton...