Sciweavers

5580 search results - page 136 / 1116
» Randomized priority algorithms
Sort
View
PODC
1999
ACM
15 years 2 months ago
Analysis of Timing-Based Mutual Exclusion with Random Times
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...
Eli Gafni, Michael Mitzenmacher
APPROX
2010
Springer
146views Algorithms» more  APPROX 2010»
14 years 11 months ago
Delaying Satisfiability for Random 2SAT
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
Alistair Sinclair, Dan Vilenchik
IJAC
2008
97views more  IJAC 2008»
14 years 10 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
ICDCS
2008
IEEE
15 years 4 months ago
Enabling Accurate Node Control in Randomized Duty Cycling Networks
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
Kang-Won Lee, Vasileios Pappas, Asser N. Tantawi
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...