2190 search results - page 137 / 438 » Learning with the Set Covering Machine |
COLT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
COMBINATORICA
2010
13 years 6 months ago
2010
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
ICALT
2003
IEEE
14 years 2 months ago
2003
IEEE
We present experiences made with a course in applied computer science which was based on the concept of communities of practice. Within the scope of the course “Entrepreneurship...
COLT
1992
Springer
14 years 1 months ago
1992
Springer
We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies lea...