DOIAbstract
AbstractThe Euclidean distance matrix for n distinct points in Rr is generically of rank r+2. It is shown in this paper via a geometric argument that its nonnegative rank for the case r=1 is generically n
AbstractThe Euclidean distance matrix for n distinct points in Rr is generically of rank r+2. It is shown in this paper via a geometric argument that its nonnegative rank for the case r=1 is generically n
International audienceEuclidean distance geometry is the study of Euclidean geometry based on the co...
In this paper we provide an application-oriented characterization of a class of distance measures mo...
The Euclidean Distance Degree (EDD) of a variety is the number of critical points of the squared dis...
AbstractThe nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one f...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors n...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors n...
A distance matrix D of order n is symmetric with elements , where dii=0. D is Euclidean when the qu...
AbstractThe nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one f...
AbstractA distance matrix D of order n is symmetric with elements −12dij2, where dii=0. D is Euclide...
AbstractWe consider the set of m×n nonnegative real matrices and define the nonnegative rank of a ma...
AbstractIn a recent paper on the theory of Euclidean distance matrices, Gower derived an inequality ...
Euclidean distance matrices (EDM) are matrices of squared distances between points. The definition i...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
AbstractWe know that the cone of Euclidean distance matrices does not intersect the cone of positive...
International audienceEuclidean distance geometry is the study of Euclidean geometry based on the co...
In this paper we provide an application-oriented characterization of a class of distance measures mo...
The Euclidean Distance Degree (EDD) of a variety is the number of critical points of the squared dis...
AbstractThe nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one f...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors n...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors n...
A distance matrix D of order n is symmetric with elements , where dii=0. D is Euclidean when the qu...
AbstractThe nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one f...
AbstractA distance matrix D of order n is symmetric with elements −12dij2, where dii=0. D is Euclide...
AbstractWe consider the set of m×n nonnegative real matrices and define the nonnegative rank of a ma...
AbstractIn a recent paper on the theory of Euclidean distance matrices, Gower derived an inequality ...
Euclidean distance matrices (EDM) are matrices of squared distances between points. The definition i...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
AbstractWe know that the cone of Euclidean distance matrices does not intersect the cone of positive...
International audienceEuclidean distance geometry is the study of Euclidean geometry based on the co...
In this paper we provide an application-oriented characterization of a class of distance measures mo...
The Euclidean Distance Degree (EDD) of a variety is the number of critical points of the squared dis...
Add to ORKG