719 search results - page 24 / 144 » Solving Sparse Linear Constraints |
PPAM
2005
Springer
15 years 3 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
100
click to vote
ACCV
2007
Springer
15 years 2 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
ICA
2004
Springer
15 years 3 months ago
2004
Springer
We consider the Blind Source Separation problem of linear mixtures with singular matrices and show that it can be solved if the sources are sufficiently sparse. More generally, we ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
118
click to vote
TIT
2010
14 years 5 months ago
2010
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...