19 citations · 54 across the 25 of their papers we have counts for
4 papers · 1 filter
Localization from structured distance matrices via low-rank matrix recovery
Samuel Lichtenberg, Abiy Tasissa
We study the problem of determining the configuration of points by using their distances to nodes, referred to as anchor nodes. One sampling scheme is Nystrom sampling, whi…
Discriminative reconstruction via simultaneous dense and sparse coding
Abiy Tasissa, Emmanouil Theodosis, Bahareh Tolooshams +1
Discriminative features extracted from the sparse coding model have been shown to perform well for classification. Recent deep learning architectures have further improved reconstr…
Low-rank Matrix Completion in a General Non-orthogonal Basis
Abiy Tasissa, Rongjie Lai
This paper considers theoretical analysis of recovering a low rank matrix given a few expansion coefficients with respect to any basis. The current approach generalizes the existin…
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion
Abiy Tasissa, Rongjie Lai
The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor netw…