Sciweavers

3466 search results - page 23 / 694
» Fast computation of special resultants
Sort
View
PR
2008
90views more  PR 2008»
13 years 11 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
DATE
2003
IEEE
99views Hardware» more  DATE 2003»
14 years 4 months ago
Fast Computation of Data Correlation Using BDDs
Data correlation is a well-known problem that causes difficulty in VLSI testing. Based on a correlation metric, an efficient heuristic to select BIST registers has been proposed...
Zhihong Zeng, Qiushuang Zhang, Ian G. Harris, Maci...
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 11 months ago
Recurrence relations and fast algorithms
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
Mark Tygert
IPPS
2007
IEEE
14 years 5 months ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin
ARITH
2009
IEEE
14 years 5 months ago
Fast and Accurate Bessel Function Computation
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
John Harrison