We prove that the general symmetric tensor in $ S^ d\mathbb {C}^{n+ 1} $ of rank $ r $ is
identifiable, provided that $ r $ is smaller than the generic rank. That is, its Waring …

In applications where the tensor rank decomposition arises, one often relies on its
identifiability properties for interpreting the individual rank-1 terms appearing in the …

We present a complete classification of all minimal problems for generic arrangements of
points and lines completely observed by calibrated perspective cameras. We show that …

A homogeneous polynomial of degree d in n+ 1 variables is identifiable if it admits a unique
additive decomposition in powers of linear forms. Identifiability is expected to be very rare. In …

Designing and analyzing large cable-driven parallel robots (CDPRs) for precision tasks can
be challenging, as the position kinematics are governed by kineto-statics and cable sag …

An approach for approximate kinematic synthesis of mechanisms is proposed in this paper
which computes a graph that identifies minima of an objective function as vertices and …

We prove the existence of an open set of n_1*n_2*n_3 tensors of rank r for which popular
and efficient algorithms for computing tensor rank decompositions based on a reduction to a …

Synthesis of rigid-body mechanisms has traditionally been motivated by the design for
kinematic requirements such as rigid-body motions, paths, or functions. A blend of the latter …

The tensor rank decomposition problem consists of recovering the parameters of the model
from an identifiable low-rank tensor. These parameters are analyzed and interpreted in …

A Brain-Computer Interface (BCI) is a setup permitting the control of external devices by
decoding brain activity. Electroencephalography (EEG) has been extensively used for …