This paper demonstrates a new technology that can infer a person's emotions from RF signals reflected off his body.
Mingmin Zhao, Fadel Adib, Dina Katabi From Communications of the ACM | September 2018
"Accelerating GPU Betweenness Centrality" by McLaughlin and Bader ably addresses the challenges to authors of efficient graph implementations in the important context...John D. Owens From Communications of the ACM | August 2018
We present a hybrid GPU implementation that provides good performance on graphs of arbitrary structure rather than just scale-free graphs as was done previously...Adam McLaughlin, David A. Bader From Communications of the ACM | August 2018
"Majority Is Not Enough: Bitcoin Mining Is Vulnerable," by Eyal and Sirer, questions the 2009 Bitcoin white paper's implicit assumption of perfect information—that...Sharon Goldberg, Ethan Heilman From Communications of the ACM | July 2018
We propose a practical modification to the Bitcoin protocol that protects Bitcoin in the general case.
Ittay Eyal, Emin GÜn Sirer From Communications of the ACM | July 2018
In "Coz: Finding Code that Counts with Causal Profiling," Curtsinger and Berger describe causal profiling, which tell programmers exactly how much speed-up bang...Landon P. Cox From Communications of the ACM | June 2018
This paper introduces causal profiling. Unlike past profiling approaches, causal profiling indicates exactly where programmers should focus their optimization efforts...Charlie Curtsinger, Emery D. Berger From Communications of the ACM | June 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
"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
"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
"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