74 search results - page 11 / 15 » Weighted height of random trees |
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
JNCA
2011
12 years 10 months ago
2011
Recently, several studies have been conducted to design mobility‐based multicast routing protocols for wireless mobile ad hoc networks (MANET). These ...
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...