142 search results - page 14 / 29 » Random Spanning Trees and the Prediction of Weighted Graphs |
163
click to vote
FSTTCS
2007
Springer
16 years 6 days ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
167
click to vote
CIAC
2000
Springer
15 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
161
click to vote
UAI
2003
15 years 7 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
182
click to vote
INFOVIS
2003
IEEE
15 years 11 months ago
2003
IEEE
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
173
click to vote
AINA
2007
IEEE
16 years 11 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...