We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata.Filippo Bonchi, Damien Pous From Communications of the ACM | February 2015
"Neural Acceleration for General-Purpose Approximate Programs" demonstrates the significant advantages in cost, power, and latency through approximate computing...Ravi Nair From Communications of the ACM | January 2015
This paper describes a new approach that uses machine learning-based transformations to accelerate approximation-tolerant programs.Hadi Esmaeilzadeh, Adrian Sampson, Luis Ceze, Doug Burger From Communications of the ACM | January 2015
As GPUs have become mainstream parallel processing engines, many applications targeting GPUs now have data locality more amenable to traditional caching. The...Stephen W. Keckler From Communications of the ACM | December 2014
This paper studies the effect of accelerating highly parallel workloads with significant locality on a massively multithreaded GPU.Timothy G. Rogers, Mike O'Connor, Tor M. Aamodt From Communications of the ACM | December 2014
For years, graphics programs have simulated fabric as a collection of fibers, requiring tweaks to algorithms for each new fabric. "Building Volumetric Appearance...Szymon Rusinkiewicz From Communications of the ACM | November 2014
Visualizing and rendering cloth has been an important area of graphics research for decades. This paper proposes a new approach to acquiring volume models, based...Shuang Zhao, Wenzel Jakob, Steve Marschner, Kavita Bala From Communications of the ACM | November 2014
"Dissection: A New Paradigm for Solving Bicomposite Search Problems," by Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir, presents an elegant new algorithm...Bart Preneel From Communications of the ACM | October 2014
In this paper, we introduce the new notion of bicomposite search problems, and show that they can be solved with improved combinations of time and space complexities...Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir From Communications of the ACM | October 2014
"Moving Portraits" is, in some sense, part of the perpetual quest to capture the perfect portrait. Its principal contribution is in adapting this age-old problem...Alexei A. Efros From Communications of the ACM | September 2014
We present an approach for generating face animations from large image collections of the same person. By optimizing the quantity and order in which photos are...Ira Kemelmacher-Shlizerman, Eli Shechtman, Rahul Garg, Steven M. Seitz From Communications of the ACM | September 2014
The following paper is a breakthrough in which the authors offer a formula to calculate the probability of reading data that was not written by one of the K most...Philip A. Bernstein From Communications of the ACM | August 2014
Eventual consistency is often "good enough" for practitioners given its latency and availability benefits. In this work, we explain this phenomenon and demonstrate...Peter Bailis, Shivaram Venkataraman, Michael J. Franklin, Joseph M. Hellerstein, Ion Stoica From Communications of the ACM | August 2014
Having multiple Wi-Fi Access Points with an overlapping coverage area operating on the same frequency may not be a problem anymore.Konstantina (Dina) Papagiannaki From Communications of the ACM | July 2014
JMB, a joint multiuser beamforming system, enables independent access points (APs) to beamform their signals and communicate with their clients on the same channel...Hariharan Rahul, Swarun Kumar, Dina Katabi From Communications of the ACM | July 2014
The following paper effectively treats motion clips as a set of independent motion vectors. In their ensemble, these high-dimensional motion vectors define a...Michiel van de Panne From Communications of the ACM | June 2014
We propose a novel representation of motion data and control of virtual characters that gives highly agile responses to user input and allows a natural handling...Yongjoon Lee, Kevin Wampler, Gilbert Bernstein, Jovan Popović, Zoran Popović From Communications of the ACM | June 2014
An ideal scheme for password storage would enable a password with more than 20 bits of randomness to be input and output from the brain of a human being who is...Ari Juels, Bonnie Wong From Communications of the ACM | May 2014
We present a defense against coercion attacks using the concept of implicit learning from cognitive psychology. We use a carefully crafted computer game to allow...Hristo Bojinov, Daniel Sanchez, Paul Reber, Dan Boneh, Patrick Lincoln From Communications of the ACM | May 2014
Jacobson et al. construct a deformation method that allows a wide range of handle types (points, line segments, open and closed polygons) and produces deformations...Joe Warren From Communications of the ACM | April 2014