661 search results - page 19 / 133 » On Distributed Computation in Noisy Random Planar Networks |
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
COLCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an...
65
Voted
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
In this paper we revisit two classes of mobility models which are widely used to represent users' mobility in wireless networks: Random Waypoint (RWP) and Random Direction (R...
77
Voted
PODC
2003
ACM
15 years 2 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...