425 search results - page 22 / 85 » Polynomial Factorization 1987-1991 |
ICIP
2010
IEEE
13 years 4 months ago
2010
IEEE
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, ...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
ICCAD
2010
IEEE
13 years 5 months ago
2010
IEEE
For a variety of signal processing applications polynomials are implemented in circuits. Recent work on polynomial datapath optimization achieved significant reductions of hardware...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...