2746 search results - page 41 / 550 » Bisubmodular Function Minimization |
ADCM
2010
15 years 2 months ago
2010
Abstract. We present results about minimization of convex functionals defined over a finite set of vectors in a finite dimensional Hilbert space, that extend several known results ...
AUTOMATICA
2002
15 years 1 months ago
2002
A solution is presented for the problem of realizing a discrete-time LTI state-space model of minimal McMillan degree such that its
113
click to vote
JCT
2000
15 years 1 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
119
click to vote
SIAMJO
2008
15 years 1 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
ICSE
2009
IEEE-ACM
15 years 8 months ago
2009
IEEE-ACM
Regression test suites tend to grow over time as new test cases are added to exercise new functionality or to target newly-discovered faults. When test suites become too large, th...