Sciweavers

358 search results - page 31 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
ECOOPW
2004
Springer
15 years 7 months ago
Coordination and Adaptation Techniques for Software Entities
Abstract. Coordination and Adaptation are two key issues when developing complex distributed systems. Coordination focuses on the interaction among computational entities. Adaptati...
Carlos Canal, Juan Manuel Murillo, Pascal Poizat
PODC
2010
ACM
15 years 5 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
PODC
2003
ACM
15 years 7 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
ECCV
2004
Springer
16 years 3 months ago
A Constrained Semi-supervised Learning Approach to Data Association
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
Hendrik Kück, Nando de Freitas, Peter Carbone...
ICCV
2005
IEEE
16 years 3 months ago
An Enhanced Correlation-Based Method for Stereo Correspondence with Sub-Pixel Accuracy
The invariance of the similarity measure in photometric distortions as well as its capability in producing subpixel accuracy are two desired and often required features in most st...
Emmanouil Z. Psarakis, Georgios D. Evangelidis