Sciweavers

87 search results - page 17 / 18
» Maximal independent sets in radio networks
Sort
View
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 7 months ago
Symmetric Allocations for Distributed Storage
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
Derek Leong, Alexandros G. Dimakis, Tracey Ho
TC
1998
13 years 7 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
DSN
2007
IEEE
14 years 1 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
PODC
2010
ACM
13 years 11 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer