1055 search results - page 5 / 211 » Convex Factorization Machines |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
EOR
2010
14 years 10 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
AAAI
2006
14 years 11 months ago
2006
One of the well known risks of large margin training methods, such as boosting and support vector machines (SVMs), is their sensitivity to outliers. These risks are normally mitig...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
JMLR
2006
14 years 10 months ago
2006
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...