"Actionable Auditing Revisited," by Inioluwa Deborah Raji and Joy Buolamwini, examines how companies producing commercial facial classification software responded...Vincent Conitzer, Gillian K. Hadfield, Shannon Vallor From Communications of the ACM | January 2023
This paper investigates the commercial impact of Gender Shades, the first algorithmic audit of gender- and skin-type performance disparities in commercial facial...Inioluwa Deborah Raji, Joy Buolamwini From Communications of the ACM | January 2023
"DIAMetrics," by Shaleen Deep et al., describes a versatile framework from Google for automatic extraction of benchmarks and their distributed execution and performance...Peter Boncz From Communications of the ACM | December 2022
This paper introduces DIAMetrics: a novel framework for end-to-end benchmarking and performance monitoring of query engines.
Shaleen Deep, Anja Gruenheid, Kruthi Nagaraj, Hiro Naito, Jeff Naughton, Stratis Viglas From Communications of the ACM | December 2022
The work explored in "Hummingbird," by Sujay Narayana et al., focuses on the energy consumption of a typical GPS receiver and its operational challenges in a nanosat...Karthik Dantu From Communications of the ACM | November 2022
In this work, we elucidate the design of a low-cost, low-power GPS receiver for small satellites.
Sujay Narayana, R. Venkatesha Prasad, Vijay S. Rao, Luca Mottola, T. V. Prabhakar From Communications of the ACM | November 2022
"Traffic Classification in an Increasingly Encrypted Web," by Iman Akbari et al., does a great job in reviewing related work in the network traffic classification...Athina Markopoulou From Communications of the ACM | October 2022
In this paper, we design a novel feature engineering approach used for encrypted Web protocols, and develop a neural network architecture based on stacked long...Iman Akbari, Mohammad A. Salahuddin, Leni Ven, Noura Limam, Raouf Boutaba, Bertrand Mathieu, Stephanie Moteau, Stephane Tuffin From Communications of the ACM | October 2022
"AuraRing: Precise Electromagnetic Finger Tracking," by Farshid Salemi Parizi, Eric Whitmire, and Shwetak Patel, details the AuraRing system's remarkable ability...Yang Zhang From Communications of the ACM | October 2022
We present AuraRing, a wearable magnetic tracking system designed for tracking fine-grained finger movement.
Farshid Salemi Parizi, Eric Whitmire, Shwetak Patel From Communications of the ACM | October 2022
"Measuring Security Practices," by Louis F. DeKoven et al., provide a unique perspective into how users choose to implement common security advice in practice.
...Nicolas Christin From Communications of the ACM | September 2022
This paper seeks to make progress on the prevalence of popular security practices and their relationship to security outcomes via the longitudinal empirical measurement...Louis F. DeKoven, Audrey Randall, Ariana Mirian, Gautam Akiwate, Ansel Blume, Lawrence K. Saul, Aaron Schulman, Geoffrey M. Voelker, Stefan Savage From Communications of the ACM | September 2022
"Polymorphic Wireless Receivers," by Francesco Restuccia and Tommaso Melodia, tackles the problem of physical layer resilience in wireless systems from a completely...Falko Dressler From Communications of the ACM | September 2022
We introduce PolymoRF, a deep learning-based polymorphic receiver able to reconfigure itself in real time based on the inferred waveform parameters.
Francesco Restuccia, Tommaso Melodia From Communications of the ACM | September 2022
In "hXDP: Efficient Software Packet Processing on FPGA NICs," the authors offer an interesting solution to bridging the performance gap between the CPU and the...Noa Zilberman From Communications of the ACM | August 2022
We present hXDP, a solution to run on FPGAs software packet processing tasks described with the eBPF technology and targeting the Linux's eXpress Data Path.
Marco Spaziani Brunella, Giacomo Belocchi, Marco Bonola, Salvatore Pontarelli, Giuseppe Siracusano, Giuseppe Bianchi, Aniello Cammarano, Alessandro Palumbo, Luca Petrucci, Roberto Bifulco From Communications of the ACM | August 2022
We propose several efficient data structures for the exact and approximate variants of the fair near neighbor problem.
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri From Communications of the ACM | August 2022
In "Sampling Near Neighbors in Search for Fairness," Aumüller et al. investigate a basic problem in similarity search called near neighbor in the context of fair...Qin Zhang From Communications of the ACM | August 2022
"Expressive Querying for Accelerating Visual Analytics," by Tarique Siddiqui et al., provides a general abstraction, along with advanced interfaces, focusing on...Bill Howe From Communications of the ACM | July 2022
In this work, we introduce the problem of visualization search and highlight two underlying challenges of search enumeration and visualization matching.
Tarique Siddiqui, Paul Luh, Zesheng Wang, Karrie Karahalios, Aditya G. Parameswaran From Communications of the ACM | July 2022