22 search results - page 5 / 5 » Approximating k-hop Minimum Spanning Trees in Euclidean Metr... |
MOBIHOC
2007
ACM
14 years 6 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
FOCS
2002
IEEE
14 years 7 days ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...