122 search results - page 5 / 25 » Fast matrix multiplication is stable |
IPPS
1999
IEEE
15 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....
76
Voted
3DIM
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes a fast, simultaneous alignment method for a large number of range images. Generally the most time-consuming task in aligning range images is searching corresp...
85
Voted
NA
2010
14 years 8 months ago
2010
We describe a fast solver for linear systems with reconstructible Cauchylike structure, which requires O(rn2 ) floating point operations and O(rn) memory locations, where n is th...
64
Voted
CLUSTER
2002
IEEE
15 years 2 months ago
2002
IEEE
In modern clustering environments where the memory hierarchy has many layers (distributed memory, shared memory layer, cache, ¡ ¢ ), an important question is how to fully u...
56
Voted
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...