2084 search results - page 144 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
130
Voted
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
173
Voted
ALGORITHMICA
2006
15 years 5 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
108
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
146
click to vote
CLEF
2010
Springer
15 years 5 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
132
Voted
CC
2007
Springer
15 years 5 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...