activity
20092023
most citedGeneral Tensor Decomposition, Moment Matrices and Applications

49 citations · 69 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CL2023

Estimating Post-OCR Denoising Complexity on Numerical Texts

Arthur Hemmer, Jérôme Brachat, Mickaël Coustaty +1

Post-OCR processing has significantly improved over the past few years. However, these have been primarily beneficial for texts consisting of natural, alphabetical words, as oppose…

math.AG2012★ 3 cited

A comparison of different notions of ranks of symmetric tensors

Alessandra Bernardi, Jérôme Brachat, Bernard Mourrain

We introduce various notions of rank for a symmetric tensor, namely: rank, border rank, catalecticant rank, generalized rank, scheme length, border scheme length, extension rank an…

math.AG2011★ 49 cited

General Tensor Decomposition, Moment Matrices and Applications

Alessandra Bernardi, Jerome Brachat, Pierre Comon +1

The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous t…

math.AG2011

Extensors and the Hilbert scheme

Jerome Brachat, Paolo Lella, Bernard Mourrain +1

The Hilbert scheme parametrizes closed subschemes and families of closed subschemes in the projective space with a fixed Hilbert polynomia…

cs.SC2009★ 8 cited

The Hilbert scheme of points and its link with border basis

Mariemi Alonso, Jérome Brachat, Bernard Mourrain

In this paper, we give new explicit representations of the Hilbert scheme of points in $\PP^{r}$ as a projective subvariety of a Grassmanniann variety. This new explicit descri…

cs.SC2009★ 9 cited

Symmetric tensor decomposition

Jerome Brachat, Pierre Comon, Bernard Mourrain +1

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 fo…