7228 search results - page 140 / 1446 » From Algorithmic to Subjective Randomness |
128
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
137
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
201
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
129
Voted
RSA
2002
15 years 3 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
158
Voted
DASFAA
2011
IEEE
14 years 7 months ago
2011
IEEE
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...