495 search results - page 11 / 99 » Probability Trees |
RECOMB
2001
Springer
14 years 9 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
DAGSTUHL
2007
13 years 10 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
FSKD
2007
Springer
14 years 2 months ago
2007
Springer
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
CAAP
1992
14 years 20 days ago
1992
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
FCT
2009
Springer
14 years 3 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...