3898 search results - page 353 / 780 » On the Bit Extraction Problem |
112
Voted
TALG
2010
15 years 2 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
158
click to vote
SOCIALCOM
2010
15 years 1 months ago
2010
-- Assessing the value of individual users' contributions in peer-production systems is paramount to the design of mechanisms that support collaboration and improve users'...
132
click to vote
WIOPT
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we investigate the stability and delay issues of a two-user multi-access channel at the bit level. The two users, have the option to transmit at a higher rate (measu...
143
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when th...
162
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length n such that the error probability goes to zero as n goes to infinity....