8 search results - page 1 / 2 » Optimizing Sparse Matrix Computations for Register Reuse in ... |
ICCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
PPAM
2005
Springer
13 years 10 months ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
SIAMNUM
2011
12 years 11 months ago
2011
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...