Sign In

Communications of the ACM

Latest Research



Learning Topic Models – Provably and Efficiently
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.

Computational Complexity and Information Asymmetry in Financial Products
From Communications of the ACM

Computational Complexity and Information Asymmetry in Financial Products

Securitization of cash flows using financial derivatives transformed the financial industry over the last three decades. Derivatives...

Geometry, Flows, and Graph-Partitioning Algorithms
From Communications of the ACM

Geometry, Flows, and Graph-Partitioning Algorithms

"Graph partitioning" refers to a family of computational problems in which the vertices of a graph have to be partitioned...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account