Megasthenis Asteris

According to our database1, Megasthenis Asteris authored at least 15 papers between 2011 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Trading-off variance and complexity in stochastic gradient descent.
CoRR, 2016

A Simple and Provable Algorithm for Sparse Diagonal CCA.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Bipartite Correlation Clustering: Maximizing Agreements.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
On Approximating the Sum-Rate for Multiple-Unicasts.
CoRR, 2015

Sparse PCA via Bipartite Matchings.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Orthogonal NMF through Subspace Exploration.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On approximating the sum-rate for multiple-unicasts.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Stay on path: PCA along graph paths.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
The Sparse Principal Component of a Constant-Rank Matrix.
IEEE Trans. Inf. Theory, 2014

Nonnegative Sparse PCA with Provable Guarantees.
Proceedings of the 31th International Conference on Machine Learning, 2014

Combinatorial QPs via a low-dimensional subspace sampling.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013
XORing Elephants: Novel Erasure Codes for Big Data.
Proc. VLDB Endow., 2013

Building a Low-Cost Digital Garden as a Telecom Lab Exercise.
IEEE Pervasive Comput., 2013

2012
Repairable Fountain codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Sparse principal component of a rank-deficient matrix.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011


  Loading...