9886 search results - page 411 / 1978 » Learning Compressible Models |
204
click to vote
INDOCRYPT
2005
Springer
16 years 1 months ago
2005
Springer
In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and ...
196
click to vote
WACV
2002
IEEE
16 years 14 days ago
2002
IEEE
The use of fractals in computer graphics and vision in modeling unstructured images, and compressing images, is well known. However, the use of fractals for indexing images in con...
185
Voted
FSE
2001
Springer
16 years 2 days ago
2001
Springer
We show two methods of distinguishing the LEVIATHAN stream cipher from a random stream using 236 bytes of output and proportional effort; both arise from compression within the ci...
177
click to vote
DAC
1997
ACM
15 years 11 months ago
1997
ACM
This paper presents a power evaluation framework designed for estimating power consumption of a new video telephone compression standard, ITU-H.263, at the system level. A hierarc...
200
Voted
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...