Sciweavers

40 search results - page 3 / 8
» Sparse matrix storage revisited
Sort
View
ICASSP
2011
IEEE
13 years 8 days ago
Revisiting adaptive least-squares estimation and application to online sparse signal recovery
This paper presents a novel time-adaptive estimation technique by revisiting the classical Wiener-Hopf equation. Any convex and not necessarily differentiable function can be used...
Konstantinos Slavakis, Yannis Kopsinis, Sergios Th...
IAJIT
2011
13 years 3 months ago
Blocked-based sparse matrix-vector multiplication on distributed memory parallel computers
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
Rukhsana Shahnaz, Anila Usman
ICPP
2009
IEEE
14 years 3 months ago
Perfomance Models for Blocked Sparse Matrix-Vector Multiplication Kernels
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...
ICMCS
2009
IEEE
250views Multimedia» more  ICMCS 2009»
13 years 6 months ago
Efficient sparse self-similarity matrix construction for repeating sequence detection
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
Lei Wang, Chng Eng Siong, Haizhou Li
ISHPC
1997
Springer
14 years 21 days 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