Sciweavers

20 search results - page 2 / 4
» The total path length of split trees
Sort
View
EVOW
2010
Springer
13 years 11 months ago
Top-Down Induction of Phylogenetic Trees
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...
Celine Vens, Eduardo Costa, Hendrik Blockeel
LCN
2008
IEEE
13 years 11 months ago
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
Fen Zhou, Miklós Molnár, Bernard Cou...
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
13 years 8 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
NETWORKS
2007
13 years 4 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
WCE
2007
13 years 5 months ago
Models of Adding Relations to a Linking Pin Type Organization Structure
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
Kiyoshi Sawada