574 search results - page 17 / 115 » Approximation Algorithms for Free-Label Maximization |
FCT
2003
Springer
14 years 1 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
PAMI
2008
13 years 8 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
MICCAI
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. The paper introduces an algorithm which allows the automatic segmentation of multi channel magnetic resonance images. We extended the Expectation Maximization-Mean Field ...
DAM
2006
13 years 8 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...