3898 search results - page 202 / 780 » On the Bit Extraction Problem |
138
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
127
click to vote
ACISP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
125
click to vote
FOCM
2008
15 years 3 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
117
click to vote
TIT
2011
14 years 10 months ago
2011
—An asymptotically optimum test for the problem of decentralized sequential hypothesis testing is presented. The induced communication between sensors and fusion center is asynch...
116
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we consider the source-channel rate allocation for different transmission schemes. We propose a new trellis structure and a new algorithm that are able to deal with...