886 search results - page 7 / 178 » On the Autoreducibility of Random Sequences |
RSA
2011
13 years 2 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
RSA
2008
13 years 7 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
JSS
2010
13 years 6 months ago
2010
Random testing is not only a useful testing technique in itself, but also plays a core role in many other testing methods. Hence, any significant improvement to random testing ha...
IDEAS
2007
IEEE
14 years 1 months ago
2007
IEEE
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...