297 search results - page 2 / 60 » Every Sequence Is Decompressible from a Random One |
142
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
196
click to vote
IJNSEC
2011
15 years 21 days ago
2011
In this paper, cyclic elliptic curves of the form y2 + xy = x3 + ax2 + b, a, b ∈ GF(2m ) with order M is considered in the design of a Symmetric Key Image Encryption Scheme with...
167
click to vote
ICIP
1998
IEEE
16 years 7 months ago
1998
IEEE
To convert a compressed video sequence to a lowerresolution compressed video, one typically needs to decompress the original sequence, down-sample each frame, and recompress it. I...
165
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
160
click to vote
BMCBI
2005
15 years 5 months ago
2005
Background: Whole-genome sequencing projects are rapidly producing an enormous number of new sequences. Consequently almost every family of proteins now contains hundreds of membe...