Sciweavers

394 search results - page 5 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
88
Voted
GD
2008
Springer
15 years 1 months ago
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
Evmorfia N. Argyriou, Michael A. Bekos, Michael Ka...
97
Voted
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 6 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
ICCV
2011
IEEE
14 years 13 days ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
117
Voted
CVPR
2008
IEEE
16 years 2 months ago
On errors-in-variables regression with arbitrary covariance and its application to optical flow estimation
Linear inverse problems in computer vision, including motion estimation, shape fitting and image reconstruction, give rise to parameter estimation problems with highly correlated ...
Björn Andres, Claudia Kondermann, Daniel Kond...
115
Voted
ECCV
2006
Springer
16 years 2 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner