297 search results - page 1 / 60 » Every Sequence Is Decompressible from a Random One |
CIE
2006
Springer
13 years 9 months ago
2006
Springer
TCS
1998
13 years 5 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
FSE
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
DCC
2010
IEEE
14 years 7 days ago
2010
IEEE
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
ECCC
2008
13 years 5 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...