4218 search results - page 519 / 844 » Complete sets of cooperations |
140
click to vote
DAM
2007
15 years 4 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
123
click to vote
JPDC
2006
15 years 4 months ago
2006
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably b...
118
click to vote
NPL
2008
15 years 4 months ago
2008
A decomposition approach to multiclass classification problems consists in decomposing a multiclass problem into a set of binary ones. Decomposition splits the complete multiclass ...
131
click to vote
MP
2006
15 years 4 months ago
2006
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
155
click to vote
PAMI
2008
15 years 4 months ago
2008
We construct an image segmentation scheme that combines top-down (TD) with bottom-up (BU) processing. In the proposed scheme, segmentation and recognition are intertwined rather th...