Sciweavers

2519 search results - page 382 / 504
» Martingales and Locality in Distributed Computing
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
MOBIHOC
2004
ACM
14 years 9 months ago
Towards mobility as a network control primitive
In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlle...
David Kiyoshi Goldenberg, Jie Lin, A. Stephen Mors...
EUROPAR
2009
Springer
14 years 4 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
IPSN
2007
Springer
14 years 4 months ago
Robust message-passing for statistical inference in sensor networks
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
Jeremy Schiff, Dominic Antonelli, Alexandros G. Di...
MOBIWAC
2006
ACM
14 years 4 months ago
Calibration-free WLAN location system based on dynamic mapping of signal strength
In this work we present a calibration-free system for locating wireless local area network devices, based on the radio frequency characteristics of such networks. Calibration proc...
Luís Felipe M. de Moraes, Bruno Astuto A. N...