2496 search results - page 9 / 500 » On covering by translates of a set |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
DAM
2007
13 years 7 months ago
2007
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...