60 search results - page 3 / 12 » On the Computation of the GCD of 2-D Polynomials |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
CDC
2009
IEEE
14 years 12 days ago
2009
IEEE
— We give necessary and sufficient conditions, based on the existence of a Lyapunov functional, for the asymptotic stability of a square autonomous 2-D behavior in the sense of ...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
We present an analytic solution to the problem of estimating multiple 2-D and 3-D motion models from two-view correspondences or optical flow. The key to our approach is to view th...
TCS
2008
13 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...