99 search results - page 7 / 20 » Optimal Bounds on Tail Probabilities - A Simplified Approach |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
COMPUTER
2002
13 years 7 months ago
2002
tail defines the level of abstraction used to implement the model's components. A highly detailed model will faithfully simulate all aspects of machine operation, whether or n...
AI
2010
Springer
13 years 4 months ago
2010
Springer
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...