Sciweavers

1542 search results - page 21 / 309
» Kernelization of packing problems
Sort
View
COR
2011
13 years 3 months ago
A squeaky wheel optimisation methodology for two-dimensional strip packing
The two dimensional strip packing problem occurs in industries such as metal, wood, glass, paper, and textiles. The problem involves cutting shapes from a larger stock sheet or ro...
Edmund K. Burke, Matthew R. Hyde, Graham Kendall
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 2 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee
ICANN
2005
Springer
14 years 2 months ago
Training of Support Vector Machines with Mahalanobis Kernels
Abstract. Radial basis function (RBF) kernels are widely used for support vector machines. But for model selection, we need to optimize the kernel parameter and the margin paramete...
Shigeo Abe
NECO
2010
97views more  NECO 2010»
13 years 7 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
14 years 2 months ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang