103 search results - page 17 / 21 » Approximating rooted Steiner networks |
110
click to vote
INFOCOM
2010
IEEE
15 years 7 days ago
2010
IEEE
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
161
Voted
WINE
2010
Springer
14 years 11 months ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
121
Voted
NETWORKING
2004
15 years 3 months ago
2004
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. Since exact probabilistic diagnosis is known to be an NP-hard problem, a...
117
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
100
Voted
ISCC
2007
IEEE
15 years 8 months ago
2007
IEEE
A long horizon end-to-end delay forecast, if possible, will be a breakthrough in traffic engineering. This paper introduces a hybrid approach to forecast end-to-end delays using ...