48 search results - page 3 / 10 » Division algorithms for Bernstein polynomials |
CASC
2007
Springer
15 years 5 months ago
2007
Springer
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
155
click to vote
CASC
2011
Springer
13 years 11 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
127
Voted
ARITH
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...