This paper presents a new method to solve the relative pose between two images, using three pairs of homologous points and the knowledge of the vertical direction.Expand

We study the importance of choosing an ordering on the signatures, and we propose a new algorithm like F5 based on these extended criteria which (despite of F5) does not depend on the order of input polynomials.Expand

A modification of the G2V algorithm is presented, which makes it possible to use both Buchberger criteria in the algorithm for calculating Gröbner bases.Expand

We present the more accurate bound max{S, Dn} where S is the size of the input polynomials in dense representation, and D is the arithmetic mean value of the degrees of input poyleomials.Expand

In this paper, we study first the relationship between Pommaret bases and Hilbert series and use it to obtain a dimension depending bound for the ideal membership problem.Expand

In 2002, the third author has presented the algorithmDisPGB to compute a comprehensiveGrobner system for a parametric ideal in Montes (2002), and has implemented it in Maple.Expand

We provide a new algorithm for testing whether a monomial ideal is in Nœther position or not, without using its dimension, within a complexity which is quadratic in input size.Expand

In this article, we introduce the notion of a homogeneous ideal in strong Nœther position (SNP); a new definition for the notion of generic coordinates for some problems. This definition is simple to… Expand