Sciweavers

1503 search results - page 114 / 301
» Self-optimizing distributed trees
Sort
View
NETWORKS
2010
13 years 8 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
CCGRID
2009
IEEE
14 years 4 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...
FOCS
2009
IEEE
14 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
FIMH
2009
Springer
14 years 4 months ago
Extraction of Coronary Vascular Tree and Myocardial Perfusion Data from Stacks of Cryomicrotome Images
Computational models of myocardial perfusion in normal as well as pathological conditions have contributed to recent advances in the personalized diagnosis and treatment of cardiov...
Pepijn van Horssen, Jeroen P. H. M. van den Wijnga...
MDM
2009
Springer
149views Communications» more  MDM 2009»
14 years 4 months ago
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
Panayiotis Andreou, A. Pamboris, Demetrios Zeinali...