2924 search results - page 157 / 585 » Lower Bounds in Distributed Computing |
123
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
100
Voted
ICDCS
1995
IEEE
15 years 4 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
118
Voted
ICPADS
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, a duty cycle based multi-channel MAC protocol with multiple channel reservation, called M-cube, is proposed to tackle the triple hidden terminal problems. M-cube can...
117
Voted
DAWAK
2011
Springer
14 years 18 days ago
2011
Springer
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...