952 search results - page 36 / 191 » Computational complexity of stochastic programming problems |
GPEM
2008
13 years 11 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
VLSID
2007
IEEE
14 years 11 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
ICML
2010
IEEE
14 years 1 days ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
CVPR
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
IWPC
2010
IEEE
13 years 9 months ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...