Sciweavers

1503 search results - page 5 / 301
» Self-optimizing distributed trees
Sort
View
ISITA
2010
13 years 5 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
CPC
2008
65views more  CPC 2008»
13 years 7 months ago
The Distribution of Patterns in Random Trees
Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finite, unlabeled) tree. Assuming that every tree of Tn is equally likely, it is shown that the...
Frédéric Chyzak, Michael Drmota, Tho...
DAM
2008
74views more  DAM 2008»
13 years 7 months ago
A distributional study of the path edge-covering numbers for random trees
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
Alois Panholzer
TSP
2010
13 years 2 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
JCT
2007
150views more  JCT 2007»
13 years 7 months ago
On the degree distribution of the nodes in increasing trees
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
Markus Kuba, Alois Panholzer