Sciweavers

28 search results - page 4 / 6
» Real Solving of Bivariate Polynomial Systems
Sort
View
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
13 years 11 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
14 years 1 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 7 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
CVPR
2007
IEEE
14 years 9 months ago
A minimal solution to the autocalibration of radial distortion
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
Tomás Pajdla, Zuzana Kukelova
ECCV
2010
Springer
14 years 23 days ago
Affine Puzzle: Realigning Deformed Object Fragments without Correspondences
This paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method ...
Csaba Domokos and Zoltan Kato