48 search results - page 6 / 10 » Division algorithms for Bernstein polynomials |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
Existing digital image composition algorithms neglect the out-of-gamut problem, i.e. some pixel values in a composited image exceed the displayable or printable range. In this pap...
INFORMATICALT
2010
13 years 6 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...