1237 search results - page 26 / 248 » Abstract shade trees |
120
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
bstract: Enabling Reliable and High-Fidelity Data Center Sensing Chieh-Jan Mike Liang† , Jie Liu‡ , Liqian Luo , Andreas Terzis† † Johns Hopkins University ‡ Microsoft Re...
178
click to vote
ALGOSENSORS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
159
click to vote
SWAT
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
158
click to vote
NETWORKS
2006
15 years 4 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...