Sciweavers

1542 search results - page 42 / 309
» Kernelization of packing problems
Sort
View
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
15 years 5 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
AOR
2006
99views more  AOR 2006»
14 years 12 months ago
On-line bin Packing with Two Item Sizes
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
SCIA
2005
Springer
137views Image Analysis» more  SCIA 2005»
15 years 5 months ago
Invariance in Kernel Methods by Haar-Integration Kernels
Abstract. We address the problem of incorporating transformation invariance in kernels for pattern analysis with kernel methods. We introduce a new class of kernels by so called Ha...
Bernard Haasdonk, A. Vossen, Hans Burkhardt
ICML
2007
IEEE
16 years 19 days ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji
ICML
2005
IEEE
16 years 19 days ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi