661 search results - page 14 / 133 » On Distributed Computation in Noisy Random Planar Networks |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
DCG
2008
13 years 7 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...