Sciweavers

8431 search results - page 155 / 1687
» Algorithmically Independent Sequences
Sort
View
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
15 years 1 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
CORR
2010
Springer
71views Education» more  CORR 2010»
15 years 2 months ago
Cobham's theorem for substitutions
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper...
Fabien Durand
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
15 years 2 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald
SBIA
2004
Springer
15 years 7 months ago
Learning with Drift Detection
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Pedro Medas, Gladys Castillo, Pe...
WWW
2007
ACM
16 years 2 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li