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. Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
From Communications of the ACM | August 2022
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... Qin Zhang
From Communications of the ACM | August 2022
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account