Sciweavers

462 search results - page 59 / 93
» Covering a Tree by a Forest
Sort
View
ICML
1998
IEEE
15 years 10 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
CNSR
2006
IEEE
138views Communications» more  CNSR 2006»
15 years 3 months ago
MPLS-based Multicast Shared Trees
Abstract— This paper presents a study of our proposed architecture for the setup of a MultiPoint-to-MultiPoint (MP2MP) Label Switched Path (LSP). This form of LSP is needed for e...
Ashraf Matrawy, Wei Yi, Ioannis Lambadaris, Chung-...
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
15 years 1 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»
14 years 9 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...
COR
2007
108views more  COR 2007»
14 years 9 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian