There are few algorithms for multi-flow graphs beyond flow accumulation. The authors of "Flood-Risk Analysis on Terrains" take a big step to fill this knowledge...Shashi Shekhar From Communications of the ACM | September 2020
In this paper, we study a number of flood-risk related problems, give an overview of efficient algorithms for them, as well as explore the efficacy and efficiency...Aaron Lowe, Pankaj K. Agarwal, Mathias Rav From Communications of the ACM | September 2020
"Computing Value of Spatiotemporal Information," by Heba Aly et al., describes a technique for computing the monetary value of a person's location data for a potential...Cyrus Shahabi From Communications of the ACM | September 2020
We investigate the intrinsic value of location data in the context of strong privacy, where location information is only available from end users via purchase.
...Heba Aly, John Krumm, Gireeja Ranade, Eric Horvitz From Communications of the ACM | September 2020
We show that by making just a few changes to a parallel/distributed relational database system, such a system can become a competitive platform for scalable linear...Shangyu Luo, Zekai J. Gao, Michael Gubanov, Luis L. Perez, Dimitrije Jankov, Christopher Jermaine From Communications of the ACM | August 2020
Can we build purpose-built, warehouse-scale datacenters customized for large-scale arrays of ASIC accelerators or, to use a term coined in the paper by Michael...Parthasarathy Ranganathan From Communications of the ACM | July 2020
This paper distills lessons from Bitcoin ASIC Clouds and applies them to other large scale workloads, showing superior TCO (total cost of ownership) versus CPU...Michael Bedford Taylor, Luis Vega, Moein Khazraee, Ikuo Magaki, Scott Davidson, Dustin Richmond From Communications of the ACM | July 2020
"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
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 "Building Certified Concurrent OS Kernels" illustrate that formal verification can scale up to a moderate-size program (6,500 lines of C) that has...Andrew W. Appel From Communications of the ACM | October 2019
In this work, we present CertiKOS, a novel compositional framework for building verified concurrent OS kernels.
Ronghui Gu, Zhong Shao, Hao Chen, Jieung Kim, Jérémie Koenig, Xiongnan (Newman) Wu, Vilhelm Sjöberg, David Costanzo From Communications of the ACM | October 2019