Sciweavers

441 search results - page 25 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
HPCN
1997
Springer
15 years 2 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
DCC
2002
IEEE
15 years 9 months ago
Iterated Denoising for Image Recovery
In this paper we propose an algorithm for image recovery where completely lost blocks in an image/video-frame are recovered using spatial information surrounding these blocks. Our...
Onur G. Guleryuz
ICASSP
2011
IEEE
14 years 1 months ago
Improved thresholds for rank minimization
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
ISHPC
1997
Springer
15 years 2 months ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
Eric de Sturler, Damian Loher