BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
7 × USA
Collaborated with:
M.Braverman A.T.Kalai R.O'Donnell F.T.Leighton S.Arora R.Ge N.Alon B.Sudakov G.Valiant A.Bhaskara M.Charikar A.Vijayaraghavan R.Kannan N.Immorlica B.Lucier A.Postlewaite M.Tennenholtz Y.Halpern D.M.Mimno D.Sontag Y.Wu M.Zhu
Talks about:
algorithm (2) provabl (2) smooth (2) vandermond (1) decomposit (1) guarante (1) gaussian (1) function (1) decompos (1) approach (1)

Person: Ankur Moitra

DBLP DBLP: Moitra:Ankur

Contributed to:

STOC 20152015
STOC 20142014
ICML c2 20132013
STOC 20132013
STOC 20122012
STOC 20112011
STOC 20102010

Wrote 10 papers:

STOC-2015-Moitra #matrix
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices (AM), pp. 821–830.
STOC-2014-BhaskaraCMV #analysis
Smoothed analysis of tensor decompositions (AB, MC, AM, AV), pp. 594–603.
ICML-c2-2013-AroraGHMMSWZ #algorithm #modelling #topic
A Practical Algorithm for Topic Modeling with Provable Guarantees (SA, RG, YH, DMM, AM, DS, YW, MZ), pp. 280–288.
STOC-2013-BravermanM #approach #complexity
An information complexity approach to extended formulations (MB, AM), pp. 161–170.
STOC-2012-AlonMS #graph #scalability
Nearly complete graphs decomposable into large induced matchings and their applications (NA, AM, BS), pp. 1079–1090.
STOC-2012-AroraGKM #matrix
Computing a nonnegative matrix factorization — provably (SA, RG, RK, AM), pp. 145–162.
STOC-2011-ImmorlicaKLMPT #algorithm
Dueling algorithms (NI, ATK, BL, AM, AP, MT), pp. 215–224.
Pareto optimal solutions for smoothed analysts (AM, RO), pp. 225–234.
STOC-2010-KalaiMV #learning
Efficiently learning mixtures of two Gaussians (ATK, AM, GV), pp. 553–562.
Extensions and limits to vertex sparsification (FTL, AM), pp. 47–56.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.