ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1804.04310
  4. Cited By
Exact Reconstruction of Euclidean Distance Geometry Problem Using
  Low-rank Matrix Completion
v1v2 (latest)

Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion

12 April 2018
Abiy Tasissa
Rongjie Lai
ArXiv (abs)PDFHTML

Papers citing "Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion"

4 / 4 papers shown
Title
A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
Chandra Kundu
Abiy Tasissa
HanQin Cai
40
0
0
23 May 2025
Structured Sampling for Robust Euclidean Distance Geometry
Structured Sampling for Robust Euclidean Distance Geometry
Chandra Kundu
Abiy Tasissa
HanQin Cai
132
1
0
14 Dec 2024
Localization from Incomplete Noisy Distance Measurements
Localization from Incomplete Noisy Distance Measurements
Adel Javanmard
Andrea Montanari
177
83
0
08 Mar 2011
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear
  Norm Minimization
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Benjamin Recht
Maryam Fazel
P. Parrilo
419
3,771
0
28 Jun 2007
1