Communications of the ACM
Latest Research
From Communications of the ACM
Robustness Meets Algorithms
We give the first efficient algorithm for estimating the parameters of a high-dimensional Gaussian that is able to tolerate a constant fraction of corruptions that...
From Communications of the ACM
Learning Topic Models - Provably and Efficiently
This article shows that some new theoretical algorithms that have provable guarantees can be adapted to yield highly practical tools for topic modeling.
From Communications of the ACM