2944 search results - page 146 / 589 » Improving Bound Propagation |
CRYPTO
2003
Springer
14 years 3 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
ISSTA
2010
ACM
14 years 7 days ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
TMC
2010
13 years 8 months ago
2010
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...