3898 search results - page 14 / 780 » On the Bit Extraction Problem |
NIPS
2000
14 years 11 months ago
2000
We analyze the bit error probability of multiuser demodulators for directsequence binary phase-shift-keying (DS/BPSK) CDMA channel with additive gaussian noise. The problem of mul...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
JCT
2011
14 years 4 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...