21 search results - page 2 / 5 » A Combinatorial Algorithm Minimizing Submodular Functions in... |
WINE
2005
Springer
13 years 11 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
MOR
2000
13 years 5 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
UAI
2004
13 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
RECOMB
2010
Springer
13 years 4 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...