1542 search results - page 28 / 309 » Kernelization of packing problems |
ACTA
2008
13 years 10 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
SIAMJO
2008
13 years 9 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
Kernel methods have been popular over the last decade to solve many computer vision, statistics and machine learning problems. An important, both theoretically and practically, op...
COLT
2005
Springer
14 years 3 months ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...