8669 search results - page 104 / 1734 » Computing matrix representations |
IPPS
1999
IEEE
14 years 1 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....
ISCOPE
1999
Springer
14 years 1 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
CVPR
1996
IEEE
14 years 1 months ago
1996
IEEE
In stereo algorithms with more than two cameras, the improvement of accuracy is often reported since they are robust against noise. However, another important aspect of the polyno...
ICCS
2009
Springer
14 years 3 months ago
2009
Springer
The development of optimized codes is time-consuming and requires extensive architecture, compiler, and language expertise, therefore, computational scientists are often forced to ...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
We introduce VLADYMIR, a matrix library that permits the development of array-based code in C++. It is especially useful for numerical simulation tasks and parallelises automatical...