Sciweavers

26 search results - page 2 / 6
» Efficient complex matrix transformations with CORDIC
Sort
View
CCGRID
2011
IEEE
12 years 11 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
ICMLA
2008
13 years 9 months ago
An Improved Generalized Discriminant Analysis for Large-Scale Data Set
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...
Weiya Shi, Yue-Fei Guo, Cheng Jin, Xiangyang Xue
JPDC
2008
135views more  JPDC 2008»
13 years 7 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
13 years 11 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li