2746 search results - page 289 / 550 » Bisubmodular Function Minimization |
142
click to vote
OL
2010
15 years 3 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
152
click to vote
RECOMB
2010
Springer
15 years 3 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 ...
158
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
156
click to vote
PAMI
2012
13 years 7 months ago
2012
—We describe an approach for segmenting a moving image into regions that correspond to surfaces in the scene that are partially surrounded by the medium. It integrates both appea...
144
click to vote
VIS
2007
IEEE
16 years 6 months ago
2007
IEEE
Although real-time interactive volume rendering is available even for very large data sets, this visualization method is used quite rarely in the clinical practice. We suspect this...