Communications of the ACM
Latest Research
From Communications of the ACM
Sampling Near Neighbors in Search for Fairness
We propose several efficient data structures for the exact and approximate variants of the fair near neighbor problem.
From Communications of the ACM
Technical Perspective: Can Data Structures Treat Us Fairly?
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...
From Communications of the ACM
Technical Perspective: Visualization Search: From Sketching to Natural Language
"Expressive Querying for Accelerating Visual Analytics," by Tarique Siddiqui et al., provides a general abstraction, along with advanced interfaces, focusing on...
From Communications of the ACM
Expressive Querying for Accelerating Visual Analytics
In this work, we introduce the problem of visualization search and highlight two underlying challenges of search enumeration and visualization matching.
From Communications of the ACM
Technical Perspective: Evaluating Sampled Metrics Is Challenging
"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...
From Communications of the ACM
On Sampled Metrics for Item Recommendation
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...
From Communications of the ACM
Technical Perspective: The Compression Power of the BWT
"Resolution of the Burrows-Wheeler Transform Conjecture," by Dominik Kempa and Tomasz Kociumaka, finally settles the question of how well r in the BWT captures...
From Communications of the ACM
Resolution of the Burrows-Wheeler Transform Conjecture
In this paper, we show that r = (z log2 n) holds for every text. This result has numerous implications for text indexing and data compression.
From Communications of the ACM
Technical Perspective: Balancing At All Loads
"Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication" addresses the problem of selecting code rates to optimize system performance...
From Communications of the ACM
Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication
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...
From Communications of the ACM
Technical Perspective: 'What Is the Ideal Operating System?'
The authors of "Set the Configuration for the Heart of the OS" put a fresh view on the practicability of automatic kernel debloating.
From Communications of the ACM
Set the Configuration for the Heart of the OS: On the Practicality of Operating System Kernel Debloating
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...
From Communications of the ACM
Technical Perspective: Leveraging Social Context for Fake News Detection
In "FANG," the authors focus on a strategy of automatically detecting disinformation campaigns on online media with a new graph-based, contextual technique for...
From Communications of the ACM
FANG: Leveraging Social Context for Fake News Detection Using Graph Representation
We propose Factual News Graph (FANG), a novel graphical social context representation and learning framework for fake news detection.
From Communications of the ACM
Technical Perspective: Exploring Cognitive Bias 'In the Wild'
The authors of "Cognitive Biases in Software Development" rightly highlight the need for situated studies that examine cognitive bias 'in the wild' during software...
From Communications of the ACM
Cognitive Biases in Software Development
We conducted a two-part field study to examine the extent to which cognitive biases occur, the consequences of these biases on developer behavior, and the practices...
From Communications of the ACM
Technical Perspective: How Do Experts Learn New Programming Languages?
"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...
From Communications of the ACM
Here We Go Again: Why Is It Difficult for Developers to Learn Another Programming Language?
Our findings demonstrate that interference is a widespread phenomenon, forcing programmers to adopt suboptimal, opportunistic learning strategies.
From Communications of the ACM
Technical Perspective: Applying Design-Space Exploration to Quantum Architectures
"Toward Systematic Architectural Design of Near-Term Trapped Ion Quantum Computers" presents a study on scaling trapped-ion quantum architectures, and challenges...
From Communications of the ACM