acm-header
Sign In

Communications of the ACM

Latest Research



Sampling Near Neighbors in Search for Fairness
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.

Technical Perspective: Can Data Structures Treat Us Fairly?
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...

Technical Perspective: Visualization Search: From Sketching to Natural Language
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...

Expressive Querying for Accelerating Visual Analytics
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.

Technical Perspective: Evaluating Sampled Metrics Is Challenging
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...

On Sampled Metrics for Item Recommendation
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...

Technical Perspective: Balancing At All Loads
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...

Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication
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...

Technical Perspective: 'What Is the Ideal Operating System?'
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.

Set the Configuration for the Heart of the OS
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...

Technical Perspective: Leveraging Social Context for Fake News Detection
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...

FANG
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.

Technical Perspective: How Do Experts Learn New Programming Languages?
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...

Here We Go Again
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.

Technical Perspective: Applying Design-Space Exploration to Quantum Architectures
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...

Toward Systematic Architectural Design of Near-Term Trapped Ion Quantum Computers
From Communications of the ACM

Toward Systematic Architectural Design of Near-Term Trapped Ion Quantum Computers

Toward realizing QCCD-based trapped ion systems with 50-100 qubits, we perform an extensive application-driven architectural study evaluating the key design choices...

Technical Perspective: Personalized Recommendation of PoIs to People with Autism
From Communications of the ACM

Technical Perspective: Personalized Recommendation of PoIs to People with Autism

"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...

Supporting People with Autism Spectrum Disorders in the Exploration of PoIs
From Communications of the ACM

Supporting People with Autism Spectrum Disorders in the Exploration of PoIs: An Inclusive Recommender System

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...

Technical Perspective: On Proofs, Entanglement, and Games
From Communications of the ACM

Technical Perspective: On Proofs, Entanglement, and Games

"MIP* = RE," by Zhengfeng Ji et al., studies quantum interactive proofs.

MIP* = RE
From Communications of the ACM

MIP* = RE

In this work, we study a fourth modification to the notion of efficient verification that originates in the study of quantum entanglement.
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account