1055 search results - page 79 / 211 » Convex Factorization Machines |
113
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
106
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
132
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
114
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
DATE
2009
IEEE
15 years 7 months ago
2009
IEEE
—Body sensor networks are emerging as a promising platform for healthcare monitoring. These systems are composed of battery-operated embedded devices which process physiological ...