Sciweavers

4137 search results - page 253 / 828
» On the number of matchings of a tree
Sort
View
DATAMINE
1999
143views more  DATAMINE 1999»
15 years 6 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
INFOCOM
1997
IEEE
15 years 11 months ago
Performance Modelling of Reliable Multicast Transmission
Our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. We derive two characterizations that enable the comp...
Jörg Nonnenmacher, Ernst Biersack
RECOMB
2005
Springer
16 years 7 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
IWDC
2001
Springer
145views Communications» more  IWDC 2001»
15 years 11 months ago
Activating and Deactivating Repair Servers in Active Multicast Trees
Abstract. For time-constrained applications, repair-server-based active local recovery approaches can be valuable in providing low-latency reliable multicast service. However, an a...
Ping Ji, James F. Kurose, Donald F. Towsley
186
Voted
IJCNN
2000
IEEE
15 years 11 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King