1542 search results - page 40 / 309 » Kernelization of packing problems |
131
click to vote
RSS
2007
15 years 3 months ago
2007
— Many robot motion planning problems can be described as a combination of motion through relatively sparsely filled regions of configuration space and motion through tighter p...
ICTAI
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
125
click to vote
PDPTA
1996
15 years 3 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
129
click to vote
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
115
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...