Sciweavers

1369 search results - page 129 / 274
» Lattice computations for random numbers
Sort
View
PODC
2010
ACM
14 years 1 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
MVA
2007
158views Computer Vision» more  MVA 2007»
13 years 8 months ago
Hybrid object labelling in digital images
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
Julio Martín-Herrero
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
13 years 22 days ago
Private Discovery of Common Social Contacts
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
Emiliano De Cristofaro, Mark Manulis, Bertram Poet...
PODC
1999
ACM
14 years 1 months ago
Liveness-Preserving Simulation Relations
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
Paul C. Attie
TCS
2010
13 years 7 months ago
Canonical finite state machines for distributed systems
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
Robert M. Hierons