1298 search results - page 115 / 260 » The online set cover problem |
183
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
167
click to vote
ICONIP
2009
15 years 4 months ago
2009
In contrast to traditional machine learning algorithms, where all data are available in batch mode, the new paradigm of streaming data poses additional difficulties, since data sam...
204
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
176
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
178
click to vote
JNSM
2008
15 years 6 months ago
2008
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...