"Data-Driven Algorithm Design," by Rishi Gupta and Tim Roughgarden, addresses the issue that the best algorithm to use for many problems depends on what the input...Avrim Blum From Communications of the ACM | June 2020
The envy-free cake-cutting problem stood its ground for two decades, until it was cracked by Aziz and Mackenzie. Their solution is presented in "A Bounded and Envy...Ariel D. Procaccia From Communications of the ACM | April 2020
We report on our algorithm that resolved the well-studied cake cutting problem in which the goal is to find an envy-free allocation of a divisible resource based...Haris Aziz, Simon Mackenzie From Communications of the ACM | April 2020
Instead of handing trace records off to a collector for long-term storage and future processing, the system described in "Pivot Tracing: Dynamic Causal Monitoring...Rebecca Isaacs From Communications of the ACM | March 2020
This paper presents Pivot Tracing, a monitoring framework for distributed systems, which addresses the limitations of today's monitoring and diagnosis tools by...Jonathan Mace, Ryan Roelke, Rodrigo Fonseca From Communications of the ACM | March 2020
"Automating Visual Privacy Protection Using a Smart LED," presents a new technique to address the issue of cameras capturing proprietary or private information—it...Marco Gruteser From Communications of the ACM | February 2020
We introduce LiShield, which automatically protects a physical scene against photographing, by illuminating it with smart LEDs flickering in specialized waveforms...Shilin Zhu, Chi Zhang, Xinyu Zhang From Communications of the ACM | February 2020
OpenPiton research is one of the watershed moments in the fundamental shift toward the construction of an open source ecosystem for implementing prototype chips...Michael B. Taylor From Communications of the ACM | December 2019
We present OpenPiton, an open source framework for building scalable architecture research prototypes from one core to 500 million cores.
Jonathan Balkind, Michael McKeown, Yaosheng Fu, Tri Nguyen, Yanqi Zhou, Alexey Lavrov, Mohammad Shahrad, Adi Fuchs, Samuel Payne, Xiaohua Liang, Matthew Matl, David Wentzlaff From Communications of the ACM | December 2019
DeepXplore brings a software testing perspective to deep neural networks and, in doing so, creates the opportunity for enormous amounts of follow-on work in several...David G. Andersen From Communications of the ACM | November 2019
We design, implement, and evaluate DeepXplore, the first white-box framework for systematically testing real-world deep learning systems.
Kexin Pei, Yinzhi Cao, Junfeng Yang, Suman Jana From Communications of the ACM | November 2019
The authors of "OpenFab" propose to revisit the processing pipeline that turns a 3D model into machine instructions in light of the solutions developed in computer...Sylvain Lefebvre From Communications of the ACM | September 2019
We present OpenFab, a programmable pipeline for synthesis of multimaterial 3D printed objects that is inspired by RenderMan and modern GPU pipelines.
Kiril Vidimče, Szu-Po Wang, Jonathan Ragan-Kelley, Wojciech Matusik From Communications of the ACM | September 2019
Demand for more powerful big data analytics solutions has spurred the development of novel programming models, abstractions, and platforms. "Scaling Machine Learning...Zachary G. Ives From Communications of the ACM | May 2019
General-purpose compression struggles to achieve both good compression ratios and fast decompression for blockwise uncompressed operations. Therefore, we introduce...Ahmed Elgohary, Matthias Boehm, Peter J. Haas, Frederick R. Reiss, Berthold Reinwald From Communications of the ACM | May 2019
If facial performance capture is possible for conventional RGB videos in real time, then believable facial expressions can be transferred effortlessly from one...Hao Li From Communications of the ACM | January 2019
Face2Face is an approach for real-time facial reenactment of a monocular target video sequence (e.g., Youtube video). Our goal is to animate the facial expressions...Justus Thies, Michael Zollhöfer, Marc Stamminger, Christian Theobalt, Matthias Nießner From Communications of the ACM | January 2019
In "How to Implement Any Concurrent Data Structure," Calciu et al. show that a concurrent data structure can be built automatically and that its performance is...Tim Harris From Communications of the ACM | December 2018
We propose a method called Node Replication (NR) to implement any concurrent data structure.
Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera From Communications of the ACM | December 2018