426 search results - page 9 / 86 » The Distribution of Patterns in Random Trees |
88
Voted
CPC
1999
14 years 9 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
87
Voted
RSA
2002
14 years 9 months ago
2002
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...
EUROPAR
2001
Springer
15 years 1 months ago
2001
Springer
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large nu...
101
click to vote
ICS
2009
Tsinghua U.
15 years 2 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
101
click to vote
MCS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...