8669 search results - page 33 / 1734 » Computing matrix representations |
144
Voted
IPPS
1997
IEEE
1997
IEEE
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
15 years 6 months ago
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
120
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
173
Voted
FOCS
1992
IEEE
15 years 6 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
153
Voted
CSC
2010
15 years 22 days ago
2010
Correlation matrices are ubiquitous throughout signal processing, networking and in many areas of science. However, our study of the literature found that there is limited research...
133
Voted
ICCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...