Ankur Moitra

activity

20102012

most citedA Practical Algorithm for Topic Modeling with Provable Guarantees

165 citations · 219 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2012★ 2 cited

A Singly-Exponential Time Algorithm for Computing Nonnegative Rank

Ankur Moitra

Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O (r^{2})}$ . This is the first exact…

cs.DS2010

Vertex Sparsifiers and Abstract Rounding Algorithms

Moses Charikar, Tom Leighton, Shi Li +1

The notion of vertex sparsification is introduced in \cite{M}, where it was shown that for any graph $G = (V, E)$ and a subset of $k$ terminals $K \subset V$ , there is a polynomial…