719 search results - page 1 / 144 » Solving Sparse Linear Constraints |
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
CPC
2006
13 years 5 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
ICIP
2010
IEEE
13 years 2 months ago
2010
IEEE
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...