65 search results - page 10 / 13 » A Characterization of Weakly Bipartite Graphs |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
SIAMCOMP
2000
13 years 7 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
PAMI
2006
13 years 7 months ago
2006
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...