Sciweavers

131 search results - page 1 / 27
» Optimization techniques for small matrix multiplication
Sort
View
TCS
2011
12 years 11 months ago
Optimization techniques for small matrix multiplication
Charles-Éric Drevet, Md. Nazrul Islam, &Eac...
CCGRID
2011
IEEE
12 years 8 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
BICOB
2010
Springer
13 years 2 months ago
Multiple Kernel Learning for Fold Recognition
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...
Huzefa Rangwala
ICASSP
2011
IEEE
12 years 8 months ago
Additive character sequences with small alphabets for compressed sensing matrices
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a K × N measurement matrix for compressed sensing ...
Nam Yul Yu
IRREGULAR
1995
Springer
13 years 8 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...