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
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
"Scalable Computation of High-Order Optimization Queries," by Brucato et al., makes a case for marrying the well-established paradigms of constrained optimization...Surajit Chaudhuri From Communications of the ACM | February 2019
We present a complete system that supports package queries, a new query model that extends traditional database queries to handle complex constraints and preferences...Matteo Brucato, Azza Abouzied, Alexandra Meliou From Communications of the ACM | February 2019
"LIBS: A Bioelectrical Sensing System from Human Ears for Staging Whole-Night Sleep Study" provides a nice balance in terms of minimizing the burden on users and...Tanzeem Choudhury From Communications of the ACM | November 2018
We explore a new form of wearable systems, called LIBS, that can continuously record biosignals such as brain wave, eye movements, and facial muscle contractions...Anh Nguyen, Raghda Alqurashi, Zohreh Raghebi, Farnoush Banaei-Kashani, Ann C. Halbower, Tam Vu From Communications of the ACM | November 2018
"Majority Is Not Enough: Bitcoin Mining Is Vulnerable," by Eyal and Sirer, questions the 2009 Bitcoin white paper's implicit assumption of perfect information—that...Sharon Goldberg, Ethan Heilman From Communications of the ACM | July 2018
In "Time-Inconsistent Planning: A Computational Problem in Behavioral Economics," Kleinberg and Oren describe a graph-theoretic framework for task planning with...Nicole Immorlica From Communications of the ACM | March 2018
We propose a graph-theoretic model of tasks and goals, in which dependencies among actions are represented by a directed graph, and a time-inconsistent agent constructs...Jon Kleinberg, Sigal Oren From Communications of the ACM | March 2018
"Which Is the Fairest (Rent Division) of Them All?" focuses on the problem of rent division, and stands out in the variety of techniques applied to arrive at a...Vincent Conitzer From Communications of the ACM | February 2018
What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation...Kobi Gal, Ariel D. Procaccia, Moshe Mash, Yair Zick From Communications of the ACM | February 2018
"Halide: Decoupling Algorithms from Schedules for High-Performance Image Processing" by Ragan-Kelley et al. on the image processing language Halide explores a substantially...Manuel Chakravarty From Communications of the ACM | January 2018
We propose a new programming language for image processing pipelines, called Halide, that separates the algorithm from its schedule.
Jonathan Ragan-Kelley, Andrew Adams, Dillon Sharlet, Connelly Barnes, Sylvain Paris, Marc Levoy, Saman Amarasinghe, Frédo Durand From Communications of the ACM | January 2018
The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...David C. Parkes From Communications of the ACM | January 2018
This paper describes the process by which we built the SAT-based Feasibility Checker, a crucial element of the 2016-17 U.S. FCC "incentive auction" design.
Neil Newman, Alexandre Fréchette, Kevin Leyton-Brown From Communications of the ACM | January 2018