Sciweavers

11 search results - page 2 / 3
» Recursive Array Layouts and Fast Matrix Multiplication
Sort
View
CORR
2006
Springer
83views Education» more  CORR 2006»
13 years 11 months ago
Fast linear algebra is stable
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
James Demmel, Ioana Dumitriu, Olga Holtz
PCI
2005
Springer
14 years 4 months ago
Tuning Blocked Array Layouts to Exploit Memory Hierarchy in SMT Architectures
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
Evangelia Athanasaki, Kornilios Kourtis, Nikos Ana...
ICASSP
2011
IEEE
13 years 2 months ago
A fast transform for acoustic imaging with separable arrays
Acoustic imaging is a computationally intensive and ill-conditioned inverse problem, which involves estimating high resolution source distributions with large microphone arrays. I...
Flavio P. Ribeiro, Vitor H. Nascimento
IPPS
2003
IEEE
14 years 4 months ago
On Self-Similarity and Hamiltonicity of Dual-Cubes
The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the...
Changfu Wu, Jie Wu
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 11 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar