Sciweavers

236 search results - page 3 / 48
» Fast Sparse Matrix Multiplication
Sort
View
IPPS
2007
IEEE
13 years 11 months ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin
ICPR
2010
IEEE
14 years 12 days ago
Bayesian Inference for Nonnegative Matrix Factor Deconvolution Models
In this paper we develop a probabilistic interpretation and a full Bayesian inference for non-negative matrix deconvolution (NMFD) model. Our ultimate goal is unsupervised extract...
Serap Kirbiz, Ali Taylan Cemgil, Bilge Gunsel
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
13 years 9 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
ASAP
2006
IEEE
121views Hardware» more  ASAP 2006»
13 years 9 months ago
Reconfigurable Fixed Point Dense and Sparse Matrix-Vector Multiply/Add Unit
In this paper, we propose a reconfigurable hardware accelerator for fixed-point-matrix-vector-multiply/add operations, capable to work on dense and sparse matrices formats. The pr...
Humberto Calderon, Stamatis Vassiliadis
FCCM
2006
IEEE
268views VLSI» more  FCCM 2006»
13 years 11 months ago
Sparse Matrix-Vector Multiplication for Finite Element Method Matrices on FPGAs
We present an architecture and an implementation of an FPGA-based sparse matrix-vector multiplier (SMVM) for use in the iterative solution of large, sparse systems of equations ar...
Yousef El-Kurdi, Warren J. Gross, Dennis Giannacop...