161 search results - page 8 / 33 » Methods for convex and general quadratic programming |
STOC
2005
ACM
15 years 11 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 . ...
ICML
2007
IEEE
15 years 12 months ago
2007
IEEE
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
ACCV
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
106
click to vote
SIAMJO
2010
14 years 5 months ago
2010
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...