EUVIMEDEUVIMED entdecken
Crossref

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness

Chandler Smith, HanQin Cai, Abiy Tasissa

IEEE Transactions on Information Theory · 2026-09 · 72 (9) · 6993-7011

DOI: 10.1109/tit.2026.3715063 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-09. Verfasst von Chandler Smith und 2 weiteren Autor:innen. Die Arbeit nennt 101 Literaturangaben. Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Science Foundation

Zitieren

APA

Smith, C., Cai, H., & Tasissa, A. (2026). Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness. IEEE Transactions on Information Theory, 72(9), 6993-7011. https://doi.org/10.1109/tit.2026.3715063

Vancouver

Smith C, Cai H, Tasissa A. Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness. IEEE Transactions on Information Theory. 2026;72(9):6993-7011. doi:10.1109/tit.2026.3715063

BibTeX
@article{Smith2026,
  author = {Smith, Chandler and Cai, HanQin and Tasissa, Abiy},
  title = {Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness},
  journal = {IEEE Transactions on Information Theory},
  year = {2026},
  volume = {72},
  number = {9},
  pages = {6993--7011},
  doi = {10.1109/tit.2026.3715063}
}
Kostenlos starten →