Sciweavers

547 search results - page 64 / 110
» Efficient Model Update for General Link-Insertion Networks
Sort
View
PODC
2006
ACM
15 years 3 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
103
Voted
ESEM
2010
ACM
14 years 8 months ago
Strengthening the empirical analysis of the relationship between Linus' Law and software security
Open source software is often considered to be secure because large developer communities can be leveraged to find and fix security vulnerabilities. Eric Raymond states Linus’ L...
Andrew Meneely, Laurie A. Williams
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
15 years 10 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
POPL
2008
ACM
15 years 10 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
MOBIHOC
2008
ACM
15 years 9 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao