161 search results - page 24 / 33 » Methods for convex and general quadratic programming |
115
click to vote
IMAGING
2004
15 years 5 months ago
2004
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
136
click to vote
NIPS
2004
15 years 5 months ago
2004
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes super...
204
click to vote
SAGA
2009
Springer
15 years 11 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
175
click to vote
ISPD
1997
ACM
15 years 8 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
200
click to vote
CONCUR
1993
Springer
15 years 8 months ago
1993
Springer
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...