3898 search results - page 43 / 780 » On the Bit Extraction Problem |
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we present a generic content-based solution targeting at authenticating image in a semi-fragile way, which integrates watermarking-based approach with signature-base...
IEEEMSP
2002
IEEE
15 years 2 months ago
2002
IEEE
We present a blind data hiding method for JPEG compressedimageswhichminimizesthe perceptualdistortion due to data embedding.The proposed systempresentsa number of op. tions to the ...
155
click to vote
Publication
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
EATCS
2002
14 years 9 months ago
2002
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...