29 search results - page 5 / 6 » Convex approximations for a class of mixed-integer recourse ... |
NIPS
2007
13 years 8 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
CGF
2006
13 years 7 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
APPROX
2005
Springer
14 years 29 days ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...