3898 search results - page 31 / 780 » On the Bit Extraction Problem |
WSC
1997
14 years 11 months ago
1997
This paper presents a general approach to modeling VBR (variable bit rate) compressed full-motion video. The salient feature of such video is the existence of scenes. Scene struct...
ICC
2000
IEEE
15 years 2 months ago
2000
IEEE
fixed rate coding in terms of SNR and average throughput was obtained. In fact, the concept of variable rate adaptive In this paper, we propose a bandwidth efficient error cor- cod...
IPL
2006
14 years 9 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
PKC
2004
Springer
15 years 3 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...