Communications of the ACM
Latest Research
From Communications of the ACM
Technical Perspective: Measuring Optimization Potential with Coz
In "Coz: Finding Code that Counts with Causal Profiling," Curtsinger and Berger describe causal profiling, which tell programmers exactly how much speed-up bang...
From Communications of the ACM
Coz: Finding Code that Counts with Causal Profiling
This paper introduces causal profiling. Unlike past profiling approaches, causal profiling indicates exactly where programmers should focus their optimization efforts...
From Communications of the ACM
Technical Perspective: Breaking the Mold of Machine Learning
"Never-Ending Learning" is the latest and one of the most compelling incarnations of Tom Mitchell and his collaborators' research investigating how to broaden the...
From Communications of the ACM
Never-Ending Learning
In this paper we define more precisely the never-ending learning paradigm for machine learning, and present one case study: the Never-Ending Language Learner (NELL)...
From Communications of the ACM
Technical Perspective: Expressive Probabilistic Models and Scalable Method of Moments
The authors of "Learning Topic Models—Provably and Efficiently," developed a new method for fitting topic models and at large scale.
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
Technical Perspective: Designing Algorithms and the Fairness Criteria They Should Satisfy
"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...
From Communications of the ACM
Which Is the Fairest (Rent Division) of Them All?
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...
From Communications of the ACM
Technical Perspective: Building Bug-Free Compilers
What to do about buggy compilers? The authors of "Practical Verification of Peephole Optimizations with Alive" give us a compelling and practical answer.
From Communications of the ACM
Practical Verification of Peephole Optimizations with Alive
We created Alive, a domain-specific language for writing correct peephole optimizations and for automatically either proving them correct or else generating counterexamples...
From Communications of the ACM
Technical Perspective: Moving Spectrum
The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...
From Communications of the ACM
Deep Optimization For Spectrum Repacking
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.
From Communications of the ACM
Technical Perspective: A Simple, Elegant Approach to Non-Numeric Parallelization
"Automatically Accelerating Non-Numerical Programs by Architecture-Compiler Co-Design," by Simone Campanoni, et al., proposes a modest hardware extension to support...
From Communications of the ACM
Automatically Accelerating Non-Numerical Programs By Architecture-Compiler Co-Design
HELIX-RC is a compiler/microprocessor co-design that opens loops to parallelization by decoupling communication from thread execution in conventional multicore...
From Communications of the ACM
Technical Perspective: Exploring a Kingdom By Geodesic Measures
"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...
From Communications of the ACM
The Heat Method For Distance Computation
We introduce the heat method for solving the single- or multiple-source shortest path problem on both flat and curved domains.
From Communications of the ACM
Technical Perspective: Solving Imperfect Information Games
"Heads-Up Limit Hold'em Poker Is Solved," by Michael Bowling, et al., takes the counterfactual regret minimization method for approximating a Nash equilibrium to...
From Communications of the ACM
Heads-Up Limit Hold'em Poker Is Solved
This paper is an extended version of our original 2015 Science article, with additional results showing Cepheus' in-game performance against computer and human...
From Communications of the ACM
Technical Perspective: Shedding New Light on an Old Language Debate
"A Large-Scale Study of Programming Languages and Code Quality in GitHub," by Baishakhi Ray, et al., studies whether programming language choice and code quality...
From Communications of the ACM