7228 search results - page 434 / 1446 » From Algorithmic to Subjective Randomness |
160
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
171
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
172
click to vote
GECCO
2007
Springer
16 years 29 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
180
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
226
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...