3898 search results - page 176 / 780 » On the Bit Extraction Problem |
195
click to vote
PODC
1993
ACM
15 years 7 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
123
click to vote
NSDI
2008
15 years 5 months ago
2008
An emerging paradigm in peer-to-peer (P2P) networks is to explicitly consider incentives as part of the protocol design in order to promote good (or discourage bad) behavior. Howe...
117
click to vote
CONEXT
2009
ACM
15 years 4 months ago
2009
ACM
BitTorrent, the immensely popular file swarming system, suffers a fundamental problem: content unavailability. Although swarming scales well to tolerate flash crowds for popular c...
143
click to vote
JCM
2008
15 years 2 months ago
2008
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
TIT
2008
15 years 2 months ago
2008
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...