Sciweavers

7129 search results - page 721 / 1426
» Approximation Algorithms for Treewidth
Sort
View
170
Voted
COMPGEOM
2005
ACM
15 years 9 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
NIPS
2008
15 years 8 months ago
Multi-label Multiple Kernel Learning
We present a multi-label multiple kernel learning (MKL) formulation in which the data are embedded into a low-dimensional space directed by the instancelabel correlations encoded ...
Shuiwang Ji, Liang Sun, Rong Jin, Jieping Ye
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 8 months ago
Accelerating convergence using rough sets theory for multi-objective optimization problems
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
Luis V. Santana-Quintero, Carlos A. Coello Coello
ACTA
2008
136views more  ACTA 2008»
15 years 7 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 7 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang