Sciweavers

2766 search results - page 109 / 554
» Algorithms for trigonometric polynomials
Sort
View
ARITH
2005
IEEE
15 years 9 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...
DAGSTUHL
2006
15 years 5 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee
NPL
1998
87views more  NPL 1998»
15 years 3 months ago
Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...
Stavros J. Perantonis, Nikolaos Ampazis, Stavros V...
117
Voted
ICMS
2010
15 years 1 months ago
Efficient Evaluation of Large Polynomials
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...
Charles E. Leiserson, Liyun Li, Marc Moreno Maza, ...
ICIP
2010
IEEE
15 years 1 months ago
Robust and efficient background subtraction by quadratic polynomial fitting
We present a background subtraction algorithm aimed at efciency and robustness to common sources of disturbance such as illumination changes, camera gain and exposure variations, ...
Alessandro Lanza, Federico Tombari, Luigi di Stefa...