8669 search results - page 96 / 1734 » Computing matrix representations |
IPPS
1994
IEEE
14 years 1 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
As a recently proposed technique, sparse representation based classification (SRC) has been widely used for face recognition (FR). SRC first codes a testing sample as a sparse lin...
PDP
2006
IEEE
14 years 3 months ago
2006
IEEE
Commodity symmetric multiprocessors (SMPs), though originally intended for transaction processing, because of their availability, are now used for numerical analysis applications ...
IRREGULAR
1995
Springer
14 years 18 days ago
1995
Springer
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...
CATA
2010
13 years 10 months ago
2010
Computations with sparse matrices on "multicore cache based" computers are affected by the irregularity of the problem at hand, and performance degrades easily. In this ...