The main focus of "Heavy Hitters via Cluster-Preserving Clustering" by Kasper Green Larsen et al. is on building up sufficient information to allow a more effective...Graham Cormode From Communications of the ACM | August 2019
We develop a new algorithm for the turnstile heavy hitters problem in general turnstile streams, the EXPANDERSKETCH, which finds the approximate top-k items in...Kasper Green Larsen, Jelani Nelson, Huy L. Nguyễn, Mikkel Thorup From Communications of the ACM | August 2019
There is a need for alternative techniques for understanding and evaluating QUIC when compared with previous transport-layer protocols.
Arash Molavi Kakhki, Samuel Jero, David Choffnes, Cristina Nita-Rotaru, Alan Mislove From Communications of the ACM | July 2019
This work studies the potential of a paradigm of heterogeneous execution models by developing a specialization engine for explicit-dataflow (SEED) and integrating...Tony Nowatzki, Vinay Gangadhar, Karthikeyan Sankaralingam From Communications of the ACM | June 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
Umesh Vazirani and Thomas Vidick's "Fully Device Independent Quantum Key Distribution" provides an unexpectedly simple and elegant secure protocol solution, indeed...Gilles Brassard From Communications of the ACM | April 2019
We rigorously provide the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution.
mesh Vazirani, Thomas Vidick From Communications of the ACM | April 2019
Whether there exists a deterministic parallel algorithm for bipartite matching remains an outstanding question at the frontiers of our understanding of the role...Nisheeth K. Vishnoi From Communications of the ACM | March 2019
In this article, we give an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs.
Stephen Fenner, Rohit Gurjar, Thomas Thierauf From Communications of the ACM | March 2019
"Predicting Program Properties from 'Big Code'" presents new techniques for leveraging big code to automate two programming activities: selecting understandable...Martin C. Rinard From Communications of the ACM | March 2019
The authors of "Distributed Strategies for Computational Sprints" bring the rich theory of allocating scarce resources to the challenge of managing computational...Thomas F. Wenisch From Communications of the ACM | February 2019
We describe a computational sprinting architecture in which many, independent chip multiprocessors share a power supply and sprints are constrained by the chips'...Songchun Fan, Seyed Majid Zahedi, Benjamin C. Lee From Communications of the ACM | February 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
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. Our goal is to animate the facial expressions of the target video...Justus Thies, Michael Zollhöfer, Marc Stamminger, Christian Theobalt, Matthias Nießner From Communications of the ACM | January 2019