Realizing Euclidean distance matrices by sphere intersection
Résumé
This paper presents the theoretical properties of an algorithm to find a realization of a (full) n × n Euclidean distance matrix in the smallest possible embedding dimension. Our algorithm performs linearly in n, and quadratically in the minimum embedding dimension, which is an improvement w.r.t. other algorithms.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...