Search Sciweavers | Sciweavers

7978 search results - page 1 / 1596

» Combining shared-coin algorithms

click to vote

JPDC
2010

65views more JPDC 2010»

Combining shared-coin algorithms

13 years 3 months ago

Download www.cs.yale.edu

This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...

James Aspnes, Hagit Attiya, Keren Censor

claim paper

Read More »

click to vote

SPAA
2010
ACM

132views Distributed And Parallel Com...» more SPAA 2010»

Multi-sided shared coins and randomized set-agreement

13 years 10 months ago

Download www.cs.technion.ac.il

This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the deﬁnition of a shared-co...

Keren Censor Hillel

claim paper

Read More »

click to vote

STOC
2002
ACM

112views Algorithms» more STOC 2002»

Wait-free consensus with infinite arrivals

14 years 5 months ago

Download www.cs.yale.edu

A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...

James Aspnes, Gauri Shah, Jatin Shah

claim paper

Read More »

click to vote

VISAPP
2010

128views Computer Vision» more VISAPP 2010»

Computationally Efficient Serial Combination of Rotation-invariant and Rotation Compensating Iris Recognition Algorithms

13 years 3 months ago