4903 search results - page 313 / 981 » The Set Covering Machine |
154
click to vote
ITNG
2007
IEEE
16 years 1 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
182
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper, we present a method for data classification with application to car/non-car objects. We first developed a sample based car/non-car maximal mutual information low di...
123
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper describes the training of classifiers entirely based on virtual images, rendered by a ray-tracing software. Two classifiers, a support vector machine and a polynomial c...
161
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a novel technique for automated problem decomposition to address the problem of scalability in reinforcement learning. Our technique makes use of a set of near-optimal ...
197
click to vote
ICML
2009
IEEE
16 years 7 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...