19 citations · 54 across the 25 of their papers we have counts for
5 papers · 1 filter
Recovering Wasserstein Distance Matrices from Few Measurements
Muhammad Rana, Abiy Tasissa, HanQin Cai +2
This paper proposes two algorithms for estimating square Wasserstein distance matrices from a small number of entries. These matrices are used to compute manifold learning embeddin…
Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
Chandler Smith, HanQin Cai, Abiy Tasissa
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a bro…
Robust Node Localization for Rough and Extreme Deployment Environments
Abiy Tasissa, Waltenegus Dargie
Many applications have been identified which require the deployment of large-scale low-power wireless sensor networks. Some of the deployment environments, however, impose harsh op…
A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
Chandra Kundu, Abiy Tasissa, HanQin Cai
Euclidean Distance Matrix (EDM), which consists of pairwise squared Euclidean distances of a given point configuration, finds many applications in modern machine learning. This pap…
Prediction of the Received Power of Low-Power Networks Using Inertial Sensors
Waltenegus Dargie, Christian Poellabauer, Abiy Tasissa
Low-power and cost-effective IoT sensing nodes enable scalable monitoring of different environments. Some of these environments impose rough and extreme operating conditions, requi…