Travelled to:1 × Australia
1 × China
1 × France
2 × USA
Collaborated with:D.S.Papailiopoulos M.Asteris M.Borokhovich I.Mitliagkas C.Caramanis S.Korokythakis E.R.Elenberg K.Shanmugam A.T.Kyrillidis H.Yi B.Chandrasekaran C.Hunger M.Kazdagli A.S.Rawat S.Vishwanath M.Tiwari M.Sathiamoorthy R.Vadali S.Chen D.Borthakur
Talks about:graph (3) rank (3) pca (3) approxim (2) spars (2) path (2) low (2) understand (1) framework (1) distribut (1)
Person: Alexandros G. Dimakis
DBLP: Dimakis:Alexandros_G=
Contributed to:
2015
2015
2015
2015201420132013Wrote 8 papers:
- HPCA-2015-HungerKRDVT #comprehension #using
- Understanding contention-based channels and using them for defense (CH, MK, ASR, AGD, SV, MT), pp. 639–650.
- ICML-2015-AsterisKDYC #graph
- Stay on path: PCA along graph paths (MA, ATK, AGD, HGY, BC), pp. 1728–1736.
- KDD-2015-ElenbergSBD #distributed #framework #graph #scalability
- Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs (ERE, KS, MB, AGD), pp. 229–238.
- VLDB-2015-MitliagkasBDC #approximate #exclamation #graph #performance #rank
- FrogWild! — Fast PageRank Approximations on Graph Engines (IM, MB, AGD, CC), pp. 874–885.
- ICML-c2-2014-AsterisPD
- Nonnegative Sparse PCA with Provable Guarantees (MA, DSP, AGD), pp. 1728–1736.
- ICML-c2-2014-PapailiopoulosMDC #optimisation #rank
- Finding Dense Subgraphs via Low-Rank Bilinear Optimization (DSP, IM, AGD, CC), pp. 1890–1898.
- ICML-c3-2013-PapailiopoulosDK #approximate #rank
- Sparse PCA through Low-rank Approximations (DSP, AGD, SK), pp. 747–755.
- VLDB-2013-SathiamoorthyAPDVCB #big data #novel
- XORing Elephants: Novel Erasure Codes for Big Data (MS, MA, DSP, AGD, RV, SC, DB), pp. 325–336.