Sciweavers

2745 search results - page 19 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
J. Choi
EGH
2009
Springer
13 years 5 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
ICPR
2006
IEEE
14 years 8 months ago
Fast Linear Feature Detection Using Multiple Directional Non-Maximum Suppression
Linear feature detection is a very important issue in the areas of image analysis, computer vision, and pattern recognition. It has found applications in many diverse areas such a...
Changming Sun, Pascal Vallotton
SIGPRO
2008
89views more  SIGPRO 2008»
13 years 7 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
13 years 9 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison