Sciweavers

79 search results - page 6 / 16
» Succinct Ordinal Trees Based on Tree Covering
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 7 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
SIGSOFT
2007
ACM
14 years 8 months ago
Towards incremental adaptive covering arrays
The increasing complexity of configurable software systems creates a need for more intelligent sampling mechanisms to detect and locate failure-inducing dependencies between confi...
Adam A. Porter, Myra B. Cohen, Sandro Fouché...
ICML
1998
IEEE
14 years 8 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
IJIPT
2008
81views more  IJIPT 2008»
13 years 7 months ago
Towards seamless source mobility in SSM: design and evaluation of the Tree Morphing protocol
: Multimedia networking in the near future is expected to be dominated by group applications such as IPTV, MMORPGs, and video conferencing. Hand in hand with new service offers, th...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...