default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMegasthenis Asteris
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c10]Megasthenis Asteris, Anastasios Kyrillidis, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Bipartite Correlation Clustering: Maximizing Agreements. AISTATS 2016: 121-129- [c9]Megasthenis Asteris, Anastasios Kyrillidis, Oluwasanmi Koyejo, Russell A. Poldrack:
A Simple and Provable Algorithm for Sparse Diagonal CCA. ICML 2016: 1148-1157 - [i10]Megasthenis Asteris, Anastasios Kyrillidis, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Bipartite Correlation Clustering - Maximizing Agreements. CoRR abs/1603.02782 (2016) - [i9]Vatsal Shah, Megasthenis Asteris, Anastasios Kyrillidis, Sujay Sanghavi:
Trading-off variance and complexity in stochastic gradient descent. CoRR abs/1603.06861 (2016) - [i8]Megasthenis Asteris, Anastasios Kyrillidis, Oluwasanmi Koyejo, Russell A. Poldrack:
A simple and provable algorithm for sparse diagonal CCA. CoRR abs/1605.08961 (2016) - 2015
- [c8]Megasthenis Asteris, Anastasios Kyrillidis, Alexandros G. Dimakis, Han-Gyol Yi, Bharath Chandrasekaran:
Stay on path: PCA along graph paths. ICML 2015: 1728-1736 - [c7]Karthikeyan Shanmugam
, Megasthenis Asteris, Alexandros G. Dimakis:
On approximating the sum-rate for multiple-unicasts. ISIT 2015: 381-385 - [c6]Megasthenis Asteris, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Orthogonal NMF through Subspace Exploration. NIPS 2015: 343-351 - [c5]Megasthenis Asteris, Dimitris S. Papailiopoulos, Anastasios Kyrillidis, Alexandros G. Dimakis:
Sparse PCA via Bipartite Matchings. NIPS 2015: 766-774 - [i7]Karthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis:
On Approximating the Sum-Rate for Multiple-Unicasts. CoRR abs/1504.05294 (2015) - [i6]Megasthenis Asteris, Anastasios Kyrillidis, Alexandros G. Dimakis, Han-Gyol Yi, Bharath Chandrasekaran:
Stay on path: PCA along graph paths. CoRR abs/1506.02344 (2015) - [i5]Megasthenis Asteris, Dimitris S. Papailiopoulos, Anastasios Kyrillidis, Alexandros G. Dimakis:
Sparse PCA via Bipartite Matchings. CoRR abs/1508.00625 (2015) - 2014
- [j4]Megasthenis Asteris, Alexandros G. Dimakis:
Repairable Fountain Codes. IEEE J. Sel. Areas Commun. 32(5): 1037-1047 (2014) - [j3]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
The Sparse Principal Component of a Constant-Rank Matrix. IEEE Trans. Inf. Theory 60(4): 2281-2290 (2014) - [c4]Dimitris S. Papailiopoulos, Megasthenis Asteris, Alexandros G. Dimakis:
Combinatorial QPs via a low-dimensional subspace sampling. CISS 2014: 1-3 - [c3]Megasthenis Asteris, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Nonnegative Sparse PCA with Provable Guarantees. ICML 2014: 1728-1736 - [i4]Megasthenis Asteris, Alexandros G. Dimakis:
Repairable Fountain Codes. CoRR abs/1401.0734 (2014) - 2013
- [j2]Aggelos Bletsas, Aikaterini Vlachaki, Eleftherios Kampianakis, George Sklivanitis, John Kimionis, Konstadinos Tountas, Megasthenis Asteris, Panos P. Markopoulos:
Building a Low-Cost Digital Garden as a Telecom Lab Exercise. IEEE Pervasive Comput. 12(1): 48-57 (2013) - [j1]Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba Borthakur:
XORing Elephants: Novel Erasure Codes for Big Data. Proc. VLDB Endow. 6(5): 325-336 (2013) - [i3]Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba Borthakur:
XORing Elephants: Novel Erasure Codes for Big Data. CoRR abs/1301.3791 (2013) - [i2]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
The Sparse Principal Component of a Constant-rank Matrix. CoRR abs/1312.5891 (2013) - 2012
- [c2]Megasthenis Asteris, Alexandros G. Dimakis:
Repairable Fountain codes. ISIT 2012: 1752-1756 - 2011
- [c1]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
Sparse principal component of a rank-deficient matrix. ISIT 2011: 673-677 - [i1]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
Sparse Principal Component of a Rank-deficient Matrix. CoRR abs/1106.1651 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
