Sciweavers

441 search results - page 27 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Deterministic compressed-sensing matrices: Where Toeplitz meets Golay
Recently, the statistical restricted isometry property (STRIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this pa...
Kezhi Li, Cong Ling, Lu Gan
AAECC
2007
Springer
87views Algorithms» more  AAECC 2007»
14 years 10 months ago
Towards an accurate performance modeling of parallel sparse factorization
We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supern...
Laura Grigori, Xiaoye S. Li
IAJIT
2011
14 years 4 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
FPGA
2001
ACM
128views FPGA» more  FPGA 2001»
15 years 2 months ago
Using sparse crossbars within LUT
In FPGAs, the internal connections in a cluster of lookup tables (LUTs) are often fully-connected like a full crossbar. Such a high degree of connectivity makes routing easier, bu...
Guy G. Lemieux, David M. Lewis
GBRPR
2009
Springer
15 years 4 months ago
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...