Sciweavers

230 search results - page 22 / 46
» Sparse matrix factorization on massively parallel computers
Sort
View
TSP
2008
166views more  TSP 2008»
14 years 9 months ago
Blind Identification of Underdetermined Mixtures by Simultaneous Matrix Diagonalization
Abstract--In this paper, we study simultaneous matrix diagonalization-based techniques for the estimation of the mixing matrix in underdetermined independent component analysis (IC...
Lieven De Lathauwer, Joséphine Castaing
75
Voted
EUROPAR
2009
Springer
15 years 4 months ago
Adaptive Parallel Householder Bidiagonalization
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...
Fangbin Liu, Frank J. Seinstra
99
Voted
INTERSPEECH
2010
14 years 4 months ago
A factorial sparse coder model for single channel source separation
We propose a probabilistic factorial sparse coder model for single channel source separation in the magnitude spectrogram domain. The mixture spectrogram is assumed to be the sum ...
Robert Peharz, Michael Stark, Franz Pernkopf, Yann...
IPPS
2008
IEEE
15 years 4 months ago
Impact of multicores on large-scale molecular dynamics simulations
Processing nodes of the Cray XT and IBM Blue Gene Massively Parallel Processing (MPP) systems are composed of multiple execution units, sharing memory and network subsystems. Thes...
Sadaf R. Alam, Pratul K. Agarwal, Scott S. Hampton...
EUROPAR
2004
Springer
15 years 3 months ago
Task-Queue Based Hybrid Parallelism: A Case Study
Abstract. In this paper we report on our experiences with hybrid parallelism in PARDISO, a high-performance sparse linear solver. We start with the OpenMP-parallel numerical factor...
Karl Fürlinger, Olaf Schenk, Michael Hagemann