413 search results - page 13 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
SPAA
2010
ACM
14 years 2 months ago
2010
ACM
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
EUROPAR
2007
Springer
14 years 4 months ago
2007
Springer
The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, im...
ICPP
2000
IEEE
14 years 1 months ago
2000
IEEE
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Cooperative relay is a communication paradigm that aims to realize the capacity of multi-antenna arrays in a distributed manner. However, the symbol-level synchronization requir...
WSCG
2004
13 years 11 months ago
2004
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...