186 search results - page 9 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
ICCS
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the ma...
ECCV
2010
Springer
14 years 22 days ago
2010
Springer
We present a new histogram distance family, the Quadratic-Chi (QC). QC members are Quadratic-Form distances with a cross-bin χ2 -like normalization. The cross-bin χ2 -like normal...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
ICASSP
2010
IEEE
13 years 2 months ago
2010
IEEE
The under-determined blind source separation (BSS) problem is usually solved using the sparse component analysis (SCA) technique. In SCA, the BSS is usually solved in two steps, w...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...