1298 search results - page 81 / 260 » The online set cover problem |
202
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
193
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
217
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
173
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
143
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have alr...