5153 search results - page 578 / 1031 » Introduction to Randomized Algorithms |
190
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
200
click to vote
HISB
2011
14 years 6 months ago
2011
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
313
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
168
click to vote
OPODIS
2010
15 years 4 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
141
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...