1542 search results - page 45 / 309 » Kernelization of packing problems |
CORR
2010
Springer
15 years 13 hour ago
2010
Springer
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
114
click to vote
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
SMA
2005
ACM
15 years 7 months ago
2005
ACM
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk...
102
click to vote
COCOON
2001
Springer
15 years 6 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
102
click to vote
NN
2006
Springer
15 years 1 months ago
2006
Springer
We introduce a new learning algorithm for topographic map formation of Edgeworth-expanded Gaussian activation kernels. In order to avoid the rapid increase in kernel parameters, a...