719 search results - page 73 / 144 » Solving Sparse Linear Constraints |
100
click to vote
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
We propose a motion deblurring algorithm that exploits sparsity constraints of image patches using one single frame. In our formulation, each image patch is encoded with sparse co...
91
Voted
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
80
Voted
CCO
2001
Springer
15 years 3 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
73
Voted
WSC
2001
15 years 8 days ago
2001
We review chessboard distributions for modeling partially specified finite-dimensional random vectors. Chessboard distributions can match a given set of marginals, a given covaria...
93
Voted
CORR
2002
Springer
14 years 10 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...