2038 search results - page 131 / 408 » Loops under Strategies |
149
click to vote
TMC
2011
14 years 11 months ago
2011
— This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wish...
122
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
100
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships fr...
115
click to vote
ALT
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
169
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...