Sciweavers

793 search results - page 17 / 159
» Efficient computation of the characteristic polynomial
Sort
View
WCE
2007
13 years 8 months ago
Gauss-Radau Quadrature Rule Using Special Class of Polynomials
— A form of Gauss-Quadrature rule over [0,1] has been investigated that involves the derivative of the integrand at the pre-assigned left or right end node. This situation arises...
M. A. Bokhari, Asghar Qadir
JCP
2007
104views more  JCP 2007»
13 years 7 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
CHINAF
2008
69views more  CHINAF 2008»
13 years 7 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
IPPS
2005
IEEE
14 years 1 months ago
Improvement of Power-Performance Efficiency for High-End Computing
Left unchecked, the fundamental drive to increase peak performance using tens of thousands of power hungry components will lead to intolerable operating costs and failure rates. R...
Rong Ge, Xizhou Feng, Kirk W. Cameron
DCOSS
2007
Springer
13 years 11 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev