#### Filter Results:

- Full text PDF available (120)

#### Publication Year

1990

2017

- This year (7)
- Last 5 years (38)
- Last 10 years (89)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Olivier D. Faugeras, Bernard Mourrain
- ICCV
- 1995

We explore the geometric and algebraic relations that exist between correspondences of points and lines in an arbitrary number of images. We propose to use the formalism of the GrassmannCayleyâ€¦ (More)

- Pierre Comon, Gene H. Golub, Lek-Heng Lim, Bernard Mourrain
- SIAM J. Matrix Analysis Applications
- 2008

A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a symmetric sum of outerâ€¦ (More)

- JÃ©rÃ´me Brachat, Pierre Comon, Bernard Mourrain, Elias P. Tsigaridas
- 2009 17th European Signal Processing Conference
- 2009

We present an algorithm for decomposing a symmetric tensor of dimension n and order d as a sum of of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for symmetricâ€¦ (More)

- Pierre Comon, Bernard Mourrain
- Signal Processing
- 1996

Symmetric tensors of order larger than two arise more and more often in signal and image processing and automatic control, because of the recent use of High-Order Statistics (HOS). However, very fewâ€¦ (More)

- Bernard Mourrain
- AAECC
- 1999

In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and suucientâ€¦ (More)

- Alexis Bonnecaze, Patrick SolÃ©, Christine Bachoc, Bernard Mourrain
- IEEE Trans. Information Theory
- 1997

Type II Z 4-codes are introduced as self-dual codes over the integers modulo 4 containing the all-one vector and with euclidean weights multiple of 8: Their weight enumerators are characterized byâ€¦ (More)

- Bernard Mourrain, Jean Pascal Pavone
- J. Symb. Comput.
- 2009

This paper presents a new algorithm for solving a system of polynomials, in a domain of . It can be seen as an improvement of the Interval Projected Polyhedron algorithm proposed by Sherbrooke andâ€¦ (More)

- Bernard Mourrain, Victor Y. Pan
- J. Complexity
- 2000

We rst review the basic properties of the well known classes of Toeplitz Hankel Vandermonde and other related structured matrices and re examine their correlation to operations with univariateâ€¦ (More)

- Lionel Alberti, Bernard Mourrain, Julien Wintz
- Computer Aided Geometric Design
- 2008

We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are guaranteed to beâ€¦ (More)

- Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas
- Reliable Implementation of Real Number Algorithms
- 2008

We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size â‰¤ Ï„ , using Sturm (-Habicht) sequencesâ€¦ (More)