Sciweavers

2766 search results - page 6 / 554
» Algorithms for trigonometric polynomials
Sort
View
ASPDAC
2006
ACM
99views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Programmable numerical function generators based on quadratic approximation: architecture and synthesis method
— This paper presents an architecture and a synthesis method for programmable numerical function generators (NFGs) for trigonometric, logarithmic, square root, and reciprocal fun...
Shinobu Nagayama, Tsutomu Sasao, Jon T. Butler
IEICET
2010
124views more  IEICET 2010»
13 years 3 months ago
Fast Polar and Spherical Fourier Descriptors for Feature Extraction
Polar Fourier Descriptor(PFD) and Spherical Fourier Descriptor(SFD) are rotation invariant feature descriptors for two dimensional(2D) and three dimensional(3D) image retrieval an...
Zhuo Yang, Sei-ichiro Kamata
ARITH
1999
IEEE
14 years 23 days ago
New Algorithms for Improved Transcendental Functions on IA-64
The IA-64 architecture provides new opportunities and challenges for implementing an improved set of transcendental functions. Using several novel polynomial-based table-driven te...
Shane Story, Ping Tak Peter Tang
WSCG
2003
170views more  WSCG 2003»
13 years 9 months ago
Shading by Spherical Linear Interpolation using De Moivre's Formula
In the classical shading algorithm according to Phong, the normal is interpolated across the scanline, requiring a computationally expensive normalization in the inner loop. In th...
Anders Hast, Tony Barrera, Ewert Bengtsson
CADE
1992
Springer
14 years 16 days ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne