1434 search results - page 31 / 287 » Distributed Computing with Imperfect Randomness |
SPAA
2000
ACM
13 years 12 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
PODC
1999
ACM
13 years 12 months ago
1999
ACM
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...