We introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions.
Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova From Communications of the ACM | February 2016
An important contribution of "Answering Enumeration Queries with the Crowd" is the observation that by using the crowd for the collection of new data, we are departing...Tova Milo From Communications of the ACM | January 2016
Hybrid human/computer database systems promise to greatly expand the usefulness of query processing by incorporating the crowd. Such systems raise many implementation...Beth Trushkowsky, Tim Kraska, Michael J. Franklin, Purnamrita Sarkar From Communications of the ACM | January 2016
"NoDB: Efficient Query Execution on Raw Data Files" investigates extending a DBMS so it can use the file data in situ, without having to load it first.David Maier From Communications of the ACM | December 2015
We here present the design and roadmap of a new paradigm in database systems, called NoDB, which do not require data loading while still maintaining the whole feature...Ioannis Alagiannis, Renata Borovica-Gajic, Miguel Branco, Stratos Idreos, Anastasia Ailamaki From Communications of the ACM | December 2015
"Software Dataplane Verification" takes existing static checking of networks to a new level by checking the real code in the forwarding path of a Click router using...George Varghese From Communications of the ACM | November 2015
We present the result of working iteratively on two tasks: designing a domain-specific verification tool for packet-processing software, while trying to identify...Mihai Dobrescu, Katerina Argyraki From Communications of the ACM | November 2015
"Soylent: A Word Processor with a Crowd Inside," introduces an exciting vision of using crowd workers to power an interactive system — here, a word processor —...Aniket (Niki) Kittur From Communications of the ACM | August 2015
This paper introduces architectural and interaction patterns for integrating crowdsourced human contributions directly into user interfaces.Michael S. Bernstein, Greg Little, Robert C. Miller, Björn Hartmann, Mark S. Ackerman, David R. Karger, David Crowell, Katrina Panovich From Communications of the ACM | August 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
"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
"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
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