970 search results - page 88 / 194 » On encodings of spanning trees |
110
Voted
UAI
2000
15 years 2 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
102
Voted
ECSQARU
2009
Springer
15 years 7 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...
98
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
97
Voted
ADHOCNOW
2007
Springer
15 years 6 months ago
2007
Springer
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
93
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...