#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2010

2016

- This year (0)
- Last 5 years (13)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Maheswaran Sathiamoorthy, Megasthenis Asteris, +4 authors Dhruba Borthakur
- PVLDB
- 2013

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 threereplicatedâ€¦ (More)

We introduce a novel algorithm to compute nonnegative sparse principal components of positive semidefinite (PSD) matrices. Our algorithm comes with approximation guarantees contingent on the spectralâ€¦ (More)

We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture theâ€¦ (More)

- Karthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis
- 2015 IEEE International Symposium on Informationâ€¦
- 2015

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 k independent sources.â€¦ (More)

- Megasthenis Asteris, Alexandros G. Dimakis
- IEEE Journal on Selected Areas in Communications
- 2012

We introduce a new family of Fountain codes that are systematic and also have sparse parities. Given an input of k symbols, our codes produce an unbounded number of output symbols, generating eachâ€¦ (More)

Orthogonal Nonnegative Matrix Factorization (ONMF) aims to approximate a nonnegative matrix as the product of two k-dimensional nonnegative factors, one of which has orthonormal columns. It yieldsâ€¦ (More)

- Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos
- 2011 IEEE International Symposium on Informationâ€¦
- 2011

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 candidate index-setsâ€¦ (More)

We introduce a variant of (sparse) PCA in which the set of feasible support sets is determined by a graph. In particular, we consider the following setting: given a directed acyclic graph G on pâ€¦ (More)

- Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos
- IEEE Transactions on Information Theory
- 2014

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 optimal submatrix isâ€¦ (More)

Given two sets of variables, derived from a common set of samples, sparse Canonical Correlation Analysis (CCA) seeks linear combinations of a small number of variables in each set, such that theâ€¦ (More)