107 citations · 140 across the 9 of their papers we have counts for
5 papers · 1 filter
On Approximating the Sum-Rate for Multiple-Unicasts
Karthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis
We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with …
Repairable Fountain Codes
Megasthenis Asteris, Alexandros G. Dimakis
We introduce a new family of Fountain codes that are systematic and also have sparse parities. Given an input of symbols, our codes produce an unbounded number of output symbol…
The Sparse Principal Component of a Constant-rank Matrix
Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos
The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optim…
XORing Elephants: Novel Erasure Codes for Big Data
Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos +4
Distributed storage systems for large clusters typically use replication to provide reliability. Recently, erasure codes have been used to reduce the large storage overhead of thre…
Sparse Principal Component of a Rank-deficient Matrix
Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos
We consider the problem of identifying the sparse principal component of a rank-deficient matrix. We introduce auxiliary spherical variables and prove that there exists a set of ca…