Sciweavers

1542 search results - page 44 / 309
» Kernelization of packing problems
Sort
View
ICML
2008
IEEE
16 years 19 days ago
Composite kernel learning
The Support Vector Machine (SVM) is an acknowledged powerful tool for building classifiers, but it lacks flexibility, in the sense that the kernel is chosen prior to learning. Mul...
Marie Szafranski, Yves Grandvalet, Alain Rakotomam...
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
13 years 2 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
ISPD
1998
ACM
128views Hardware» more  ISPD 1998»
15 years 4 months ago
Topology constrained rectilinear block packing for layout reuse
In this paper, we formulate the problem of topology constrained rectilinear block packing in layout reuse. A speci c class of rectilinear shaped blocks, ordered convex rectilinear...
Maggie Zhiwei Kang, Wayne Wei-Ming Dai
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
15 years 6 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 1 months ago
Improved approximation algorithms for rectangle tiling and packing
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, ...