108 search results - page 21 / 22 » Spreading of Messages in Random Graphs |
ICIG
2009
IEEE
13 years 3 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
PODC
2005
ACM
13 years 11 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...