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
"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...David Silver From Communications of the ACM | November 2017
This paper is an extended version of our original 2015 Science article, with additional results showing Cepheus' in-game performance against computer and human...Michael Bowling, Neil Burch, Michael Johanson, Oskari Tammelin From Communications of the ACM | November 2017
"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...Jeffrey S. Foster From Communications of the ACM | October 2017
What is the effect of programming languages on software quality? In this study, we gather a very large data set from GitHub in an attempt to shed some empirical...Baishakhi Ray, Daryl Posnett, Premkumar Devanbu, Vladimir Filkov From Communications of the ACM | October 2017
"Multi-Objective Parametric Query Optimization," by Immanuel Trummer and Christoph Koch is a remarkable tour de force exploration of the combination of both parametric...Jeffrey F. Naughton From Communications of the ACM | October 2017
We propose a generalization of the classical database query optimization problem: multi-objective parametric query (MPQ) optimization.
Immanuel Trummer, Christoph Koch From Communications of the ACM | October 2017
"Scribe," by Walter S. Lasecki, et al., is one of the first in a recent set of crowdsourcing papers that demonstrated how human workers can collaborate with computing...Ed H. Chi From Communications of the ACM | September 2017
We discuss how our Scribe system combines human labor and machine intelligence in real time to reliably convert speech to text with less than 4s latency.
Walter S. Lasecki, Christopher D. Miller, Iftekhar Naim, Raja Kushalnagar, Adam Sadilek, Daniel Gildea, Jeffrey P. Bigham From Communications of the ACM | September 2017
"Exploiting the Analog Properties of Digital Circuits for Malicious Hardware," by Kaiyuan Yang, et al., assumes semiconductor foundries (and others in chip fabrication)...Charles (Chuck) Thacker From Communications of the ACM | September 2017
We show how a fabrication-time attacker can leverage analog circuits to create a hardware attack that is small and stealthy.
Kaiyuan Yang, Matthew Hicks, Qing Dong, Todd Austin, Dennis Sylvester From Communications of the ACM | September 2017
To avoid costly feedback loops between design, engineering, and fabrication, research in computer graphics has recently tried to incorporate key aspects of function...Helmut Pottmann From Communications of the ACM | August 2017
In this article, we describe an algorithm to generate designs for spinning objects by optimizing their mass distribution.
Moritz Bächer, Bernd Bickel, Emily Whiting, Olga Sorkine-Hornung From Communications of the ACM | August 2017