2655 search results - page 222 / 531 » LT Network Codes |
190
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
203
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
207
click to vote
ADHOCNOW
2004
Springer
15 years 12 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
157
click to vote
C5
2003
IEEE
15 years 11 months ago
2003
IEEE
This poster presentation introduces our first Squeak workshops offered in the context of the ALAN-K (Advanced LeArning Network in Kyoto) project (Konomi and Karuno, 2003), which i...
146
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...