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
"On Sampled Metrics for Item Recommendation," by Walid Krichene and Steffen Rendle, exposes a crucial aspect for the evaluation of algorithms and tools: the impact...Fabio Vandin From Communications of the ACM | July 2022
This paper investigates sampled metrics and shows that it is possible to improve the quality of sampled metrics by applying a correction, obtained by minimizing...Walid Krichene, Steffen Rendle From Communications of the ACM | July 2022
"Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication" addresses the problem of selecting code rates to optimize system performance...Emina Soljanin From Communications of the ACM | May 2022
We propose a rateless fountain coding strategy and prove that its latency is asymptotically equal to ideal load balancing, and it performs asymptotically zero redundant...Ankur Mallick, Malhar Chaudhari, Utsav Sheth, Ganesh Palanikumar, Gauri Joshi From Communications of the ACM | May 2022
The authors of "Set the Configuration for the Heart of the OS" put a fresh view on the practicability of automatic kernel debloating.
Daniel Lohmann From Communications of the ACM | May 2022
This paper presents a study on the practicality of operating system kernel debloating, that is, reducing kernel code that is not needed by the target applications...Hsuan-Chi Kuo, Jianyan Chen, Sibin Mohan, Tianyin Xu From Communications of the ACM | May 2022
We propose Factual News Graph (FANG), a novel graphical social context representation and learning framework for fake news detection.
Van-Hoang Nguyen, Kazunari Sugiyama, Preslav Nakov, Min-Yen Kan From Communications of the ACM | April 2022
"Here We Go Again: Why Is It Difficult for Developers to Learn Another Programming Language?" by Shrestha et al. provides insight into the difficulty of learning...Jonathan Aldrich From Communications of the ACM | March 2022
Our findings demonstrate that interference is a widespread phenomenon, forcing programmers to adopt suboptimal, opportunistic learning strategies.
Nischal Shrestha, Colton Botta, Titus Barik, Chris Parnin From Communications of the ACM | March 2022
"Toward Systematic Architectural Design of Near-Term Trapped Ion Quantum Computers" presents a study on scaling trapped-ion quantum architectures, and challenges...Frederic T. Chong From Communications of the ACM | March 2022
Toward realizing QCCD-based trapped ion systems with 50-100 qubits, we perform an extensive application-driven architectural study evaluating the key design choices...Prakash Murali, Dripto M. Debroy, Kenneth R. Brown, Margaret Martonosi From Communications of the ACM | March 2022
"Supporting People with Autism Spectrum Disorders in the Exploration of PoIs" is an example of work that takes seriously the task of supporting a small group that...Robin Burke From Communications of the ACM | February 2022
We propose a novel Top-N recommendation model that combines information about an autistic user's idiosyncratic aversions with her/his preferences in a personalized...Noemi Mauro, Liliana Ardissono, Federica Cena From Communications of the ACM | February 2022
"MIP* = RE," by Zhengfeng Ji et al., studies quantum interactive proofs.
Dorit Aharonov, Michael Chapman From Communications of the ACM | November 2021
In this work, we study a fourth modification to the notion of efficient verification that originates in the study of quantum entanglement.
Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen From Communications of the ACM | November 2021