438 search results - page 14 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— A major problem in wireless sensor network localization is erroneous local geometric realizations in some parts of the network due to the sensitivity to certain distanc...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
TNN
1998
13 years 7 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...