625 search results - page 104 / 125 » Approximating Travel Times Using Opportunistic Networking |
106
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
114
click to vote
IPSN
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
116
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
110
click to vote
IPSN
2007
Springer
15 years 8 months ago
2007
Springer
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
114
click to vote
WWW
2011
ACM
14 years 8 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...