Sciweavers

644 search results - page 55 / 129
» Decomposition Complexity
Sort
View
SI3D
2006
ACM
15 years 6 months ago
Normal mapping for precomputed radiance transfer
Normal mapping is a variant of bump mapping that is commonly used in computer games. It models complex surface variations by explicitly storing a surface normal in a texture map. ...
Peter-Pike J. Sloan
102
Voted
IPPS
1996
IEEE
15 years 4 months ago
A New Approach to Pipeline FFT Processor
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
Shousheng He, Mats Torkelson
89
Voted
ICPR
2006
IEEE
16 years 1 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
ECML
2006
Springer
15 years 4 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
86
Voted
NA
2010
144views more  NA 2010»
14 years 11 months ago
A binary powering Schur algorithm for computing primary matrix roots
An algorithm for computing primary roots of a nonsingular matrix A is presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalu...
Federico Greco, Bruno Iannazzo