This article shows that some new theoretical algorithms that have provable guarantees can be adapted to yield highly practical tools for topic modeling.
Sanjeev Arora, Rong Ge, Yoni Halpern, David Mimno, Ankur Moitra, David Sontag, Yichen Wu, Michael Zhu From Communications of the ACM | April 2018
When a serious security vulnerability is discovered in the SSL/TLS protocol, one would naturally expect a rapid response. "Analysis of SSL Certificate Reissues...Kenny Paterson From Communications of the ACM | March 2018
We use Heartbleed, a widespread OpenSSL vulnerability from 2014, as a natural experiment to determine whether administrators are properly managing their X.509 certificates...Liang Zhang, David Choffnes, Tudor Dumitraş, Dave Levin, Alan Mislove, Aaron Schulman, Christo Wilson From Communications of the ACM | March 2018
In "Time-Inconsistent Planning: A Computational Problem in Behavioral Economics," Kleinberg and Oren describe a graph-theoretic framework for task planning with...Nicole Immorlica From Communications of the ACM | March 2018
We propose a graph-theoretic model of tasks and goals, in which dependencies among actions are represented by a directed graph, and a time-inconsistent agent constructs...Jon Kleinberg, Sigal Oren From Communications of the ACM | March 2018
"Which Is the Fairest (Rent Division) of Them All?" focuses on the problem of rent division, and stands out in the variety of techniques applied to arrive at a...Vincent Conitzer From Communications of the ACM | February 2018
What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation...Kobi Gal, Ariel D. Procaccia, Moshe Mash, Yair Zick From Communications of the ACM | February 2018
What to do about buggy compilers? The authors of "Practical Verification of Peephole Optimizations with Alive" give us a compelling and practical answer.
Steve Zdancewic From Communications of the ACM | February 2018
We created Alive, a domain-specific language for writing correct peephole optimizations and for automatically either proving them correct or else generating counterexamples...Nuno P. Lopes, David Menendez, Santosh Nagarakatte, John Regehr From Communications of the ACM | February 2018
"Halide: Decoupling Algorithms from Schedules for High-Performance Image Processing" by Ragan-Kelley et al. on the image processing language Halide explores a substantially...Manuel Chakravarty From Communications of the ACM | January 2018
We propose a new programming language for image processing pipelines, called Halide, that separates the algorithm from its schedule.
Jonathan Ragan-Kelley, Andrew Adams, Dillon Sharlet, Connelly Barnes, Sylvain Paris, Marc Levoy, Saman Amarasinghe, Frédo Durand From Communications of the ACM | January 2018
The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...David C. Parkes From Communications of the ACM | January 2018
This paper describes the process by which we built the SAT-based Feasibility Checker, a crucial element of the 2016-17 U.S. FCC "incentive auction" design.
Neil Newman, Alexandre Fréchette, Kevin Leyton-Brown From Communications of the ACM | January 2018
"Automatically Accelerating Non-Numerical Programs by Architecture-Compiler Co-Design," by Simone Campanoni, et al., proposes a modest hardware extension to support...James Larus From Communications of the ACM | December 2017
HELIX-RC is a compiler/microprocessor co-design that opens loops to parallelization by decoupling communication from thread execution in conventional multicore...Simone Campanoni, Kevin Brownell, Svilen Kanev, Timothy M. Jones, Gu-Yeon Wei, David Brooks From Communications of the ACM | December 2017
"A Theory of Pricing Private Data," by Chao Li, et al., introduces a fascinating and complicated issue that arises on the buy-side of the market when buyers are...Aaron Roth From Communications of the ACM | December 2017
We describe the foundations of a market in which those seeking access to data must pay for it and individuals are compensated for the loss of privacy they may suffer...Chao Li, Daniel Yang Li, Gerome Miklau, Dan Suciu From Communications of the ACM | December 2017
"The Heat Method for Distance Computation," by Crane, Weischedel, and Wardetzky, shows that the gradient of the probability density function of a random walk is...Marc Alexa From Communications of the ACM | November 2017
We introduce the heat method for solving the single- or multiple-source shortest path problem on both flat and curved domains.
Keenan Crane, Clarisse Weischedel, Max Wardetzky From Communications of the ACM | November 2017