116 search results - page 8 / 24 » Separable convex optimization problems with linear ascending... |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
CONSTRAINTS
2010
13 years 6 months ago
2010
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
GD
2005
Springer
14 years 2 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— In this paper, we consider a discrete-time stochastic system, where sensor measurements are sent over a network to the controller. The design objective is a non-classic...