2084 search results - page 405 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
WWW
2011
ACM
14 years 4 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
94
Voted
PODS
2006
ACM
15 years 9 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
106
click to vote
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
100
click to vote
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...