388 search results - page 2 / 78 » The covering number in learning theory |
COLT
1999
Springer
13 years 11 months ago
1999
Springer
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...