We present a cost model for analyzing the memory efficiency of algorithms expressed in a simple functional language.Guy E. Blelloch, Robert Harper From Communications of the ACM | July 2015
The authors of IllumiRoom investigate what AR/VR could look like in a truly social environment — the living room.Patrick Baudisch From Communications of the ACM | June 2015
IllumiRoom is a proof-of-concept system that surrounds a television with projected light, bringing video games, and film experiences out of the TV screen and into...Brett R. Jones, Hrvoje Benko, Eyal Ofek, Andrew D. Wilson From Communications of the ACM | June 2015
"Can Traditional Programming Bridge the Ninja Performance Gap for Parallel Computing Applications" advocates an appealing division of labor between a developer...James Larus From Communications of the ACM | May 2015
Current processor trends of integrating more cores with SIMD units have made it more to extract performance from applications. It is believed that traditional...Nadathur Satish, Changkyu Kim, Jatin Chhugani, Hideki Saito, Rakesh Krishnaiyer, Mikhail Smelyanskiy, Milind Girkar, Pradeep Dubey From Communications of the ACM | May 2015
Specialization improves energy-efficiency in computing but only makes economic sense if there is significant demand. A balance can often be found by designing...Trevor Mudge From Communications of the ACM | April 2015
We present the Convolution Engine (CE) — a programmable processor specialized for the convolution-like data-flow prevalent in computational photography, computer...Wajahat Qadeer, Rehan Hameed, Ofer Shacham, Preethi Venkatesan, Christos Kozyrakis, Mark Horowitz From Communications of the ACM | April 2015
In "Local Laplacian Filters," Paris et al. made a surprising move. They chose to build a system on the Laplacian pyramid, which is a very simple multiscale representation...Edward Adelson From Communications of the ACM | March 2015
In this paper, we demonstrate that state-of-the-art edge-aware filters can be achieved with standard Laplacian pyramids.Sylvain Paris, Samuel W. Hasinoff, Jan Kautz From Communications of the ACM | March 2015
As the equivalence problem is essential in many applications, we need algorithms that avoid the worst-case complexity as often as possible. In "Hacking Nondeterminism...Thomas A. Henzinger, Jean-François Raskin From Communications of the ACM | February 2015
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