Sciweavers

1977 search results - page 154 / 396
» The satisfactory partition problem
Sort
View
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
16 years 6 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
ACTA
2008
136views more  ACTA 2008»
15 years 6 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
SIAMJO
2008
175views more  SIAMJO 2008»
15 years 6 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
ATAL
2008
Springer
15 years 8 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings
JMIV
2007
145views more  JMIV 2007»
15 years 6 months ago
Level Lines Selection with Variational Models for Segmentation and Encoding
Abstract. This paper discusses the interest of the Tree of Shapes of an image as a region oriented image representation. The Tree of Shapes offers a compact and structured represen...
Coloma Ballester, Vicent Caselles, Laura Igual, Ll...