886 search results - page 84 / 178 » On the Autoreducibility of Random Sequences |
STOC
1996
ACM
14 years 3 hour ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
AMC
2007
13 years 8 months ago
2007
This paper proposes a chaotic fingerprint images encryption approach. An image of a fingerprint is encrypted via a twodimensional (2D) chaotic sequence obtained from multi-scrol...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Developers frequently use inefficient code sequences that could be fixed by simple patches. These inefficient code sequences can cause significant performance degradation and ...
BMCBI
2007
13 years 8 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...