"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
"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
"SoundWatch," by Dhruv Jain et al., provides an example of HCI research's vital role in designing architectures that trade off different computational capabilities...Jeffrey P. Bigham From Communications of the ACM | June 2022
We present SoundWatch, a smartwatch-based deep learning application to sense, classify, and provide feedback about sounds occurring in the environment.
Dhruv Jain, Hung Ngo, Pratyush Patel, Steven Goodman, Khoa Nguyen, Rachel Grossman-Kahn, Leah Findlater, Jon Froehlich From Communications of the ACM | June 2022
"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...Gonzalo Navarro From Communications of the ACM | June 2022
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.
Dominik Kempa, Tomasz Kociumaka From Communications of the ACM | June 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
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
In "FANG," the authors focus on a strategy of automatically detecting disinformation campaigns on online media with a new graph-based, contextual technique for...Philippe Cudré-Mauroux From Communications of the ACM | April 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