Sciweavers

534 search results - page 18 / 107
» Efficient polynomial L-approximations
Sort
View
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 2 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
ASPDAC
2007
ACM
146views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Practical Implementation of Stochastic Parameterized Model Order Reduction via Hermite Polynomial Chaos
Abstract-- This paper describes the stochastic model order reduction algorithm via stochastic Hermite Polynomials from the practical implementation perspective. Comparing with exis...
Yi Zou, Yici Cai, Qiang Zhou, Xianlong Hong, Sheld...
SIAMSC
2008
113views more  SIAMSC 2008»
13 years 7 months ago
Statistical Condition Estimation for the Roots of Polynomials
This paper presents fast and reliable condition estimates for the roots of a real polynomial based on the method of statistical condition estimation (SCE) by Kenney and Laub. Using...
A. J. Laub, J. Xia
FUIN
2002
76views more  FUIN 2002»
13 years 7 months ago
Making revision reversible: an approach based on polynomials
This paper deals with iterated belief change and proposes a drastic revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the in...
Salem Benferhat, Didier Dubois, Sylvain Lagrue, Od...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard