230 search results - page 35 / 46 » Sparse matrix factorization on massively parallel computers |
98
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
187
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
148
click to vote
EUROPAR
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
78
Voted
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...