743 search results - page 40 / 149 » Solving the Multiple-Instance Problem: A Lazy Learning Appro... |
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
DATE
2007
IEEE
14 years 3 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
COR
2008
13 years 9 months ago
2008
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...