Sciweavers

441 search results - page 24 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ICPR
2010
IEEE
14 years 12 months ago
Compressing Sparse Feature Vectors Using Random Ortho-Projections
In this paper we investigate the usage of random ortho-projections in the compression of sparse feature vectors. The study is carried out by evaluating the compressed features in ...
Esa Rahtu, Mikko Salo, Janne Heikkilä
ICCS
2007
Springer
15 years 4 months ago
Hierarchical-Matrix Preconditioners for Parabolic Optimal Control Problems
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
Suely Oliveira, Fang Yang
IRREGULAR
1995
Springer
15 years 1 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
CORR
2006
Springer
95views Education» more  CORR 2006»
14 years 10 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
ICPP
2008
IEEE
15 years 4 months ago
Improving the Performance of Multithreaded Sparse Matrix-Vector Multiplication Using Index and Value Compression
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
Kornilios Kourtis, Georgios I. Goumas, Nectarios K...