396 search results - page 27 / 80 » An Optimal Minimum Spanning Tree Algorithm |
105
Voted
AINA
2009
IEEE
15 years 7 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
152
Voted
MOBIHOC
2012
ACM
13 years 2 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
107
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
108
click to vote
ISPD
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
ALGORITHMICA
2008
15 years 14 days ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...