4894 search results - page 290 / 979 » The Guarding Problem - Complexity and Approximation |
160
click to vote
INFORMS
2000
15 years 6 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
204
click to vote
TEC
2008
15 years 6 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
201
click to vote
MOC
2011
15 years 1 months ago
2011
The simplest pair of spaces P1/P0 is made inf-sup stable for the mixed form of the Darcy equation. The key ingredient is enhance the finite element spaces inside a PetrovGalerkin ...
173
click to vote
MOC
2010
15 years 1 months ago
2010
Abstract. We prove pointwise a posteriori error estimates for semi- and fullydiscrete finite element methods for approximating the solution u to a parabolic model problem. Our esti...
196
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...