297 search results - page 3 / 60 » Every Sequence Is Decompressible from a Random One |
3DPVT
2006
IEEE
15 years 5 months ago
2006
IEEE
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
SOFSEM
2009
Springer
15 years 3 months ago
2009
Springer
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
ICMCS
1998
IEEE
15 years 3 months ago
1998
IEEE
Current video compression formats optimize for either compression or editing. For example, motion-JPEG (MJPEG) provides excellent random access and moderate overall compression, w...
ECCC
2000
14 years 10 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...