885 citations · 2.1k across the 60 of their papers we have counts for
5 papers · 1 filter
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…
A Repair Framework for Scalar MDS Codes
Karthikeyan Shanmugam, Dimitris S. Papailiopoulos, Alexandros G. Dimakis +1
Several works have developed vector-linear maximum-distance separable (MDS) storage codes that min- imize the total communication cost required to repair a single coded symbol afte…
Sparse PCA through Low-rank Approximations
Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Stavros Korokythakis
We introduce a novel algorithm that computes the -sparse principal component of a positive semidefinite matrix . Our algorithm is combinatorial and operates by examining a di…
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…
Optimal Locally Repairable Codes and Connections to Matroid Theory
Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis
Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes like Reed-Solomon are highly sub-optim…