12 search results - page 1 / 3 » Parallel Matrix Multiplication on a Linear Array with a Reco... |
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
CJ
2004
13 years 4 months ago
2004
A parallel algorithm for Euclidean Distance Transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
The unidirectional nature of propagation and predictable delays are two characteristics of optically pipelined buses that have made them popular in recent years. Many models have ...