3898 search results - page 7 / 780 » On the Bit Extraction Problem |
112
click to vote
ECCC
1998
14 years 9 months ago
1998
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
COCO
2000
Springer
15 years 2 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
110
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, a no reference bit stream model for quality assessment of SD and HD H.264/AVC video sequences based on packet loss visibility is proposed. The method considers the ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W to agree on a secret key R in the presence of an active ...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...