Sciweavers

47 search results - page 5 / 10
» Computing the Least Fixed Point of Positive Polynomial Syste...
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
BMVC
1998
14 years 11 months ago
The Precision of 3D Reconstruction from Uncalibrated Views
We consider reconstruction algorithms using points tracked over a sequence of (at least three) images, to estimate the positions of the cameras (motion parameters), the 3D coordin...
Etienne Grossmann, José Santos-Victor
82
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
On the topology of planar algebraic curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
MICS
2010
123views more  MICS 2010»
14 years 8 months ago
On the Topology of Real Algebraic Plane Curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
IWPEC
2009
Springer
15 years 4 months ago
Even Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
Daniel Lokshtanov, Saket Saurabh