Advertisement
Technical Perspective: Improving Refugees’ Integration with Online Resource Allocation
"Dynamic Placement in Refugee Resettlement," by Narges Ahani et al., applies online resource allocation concepts to a new and important area: refugee resettlement.
Combining Machine Learning and Lifetime-Based Resource Management for Memory Allocation and Beyond
We introduce a two-step approach to attain high memory utilization in huge pages, which gives rise to a new methodology for applying Machine Learning in computer systems.
Technical Perspective: Learning-Based Memory Allocation for C++ Server Workloads
"Learning and Lifetime-Based Resource Management for Memory Allocation and Beyond," by Martin Maas et al., explores the potential of using imperfect information in the design of memory managers.
Indistinguishability Obfuscation from Well-Founded Assumptions
We examine a formalization of the “one-way compiler" concept with the notion of indistinguishability obfuscation.
Technical Perspective: Hiding Secrets in Programs
"Indistinguishability Obfuscation from Well-Founded Assumptions," by Aayush Jain et al., gives a new construction of indistinguishability obfuscation that is provably secure.
Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines
This paper discusses algorithmic priority inversion in mission-critical machine inference pipelines used in modern neural-network-based perception subsystems and describes a solution to mitigate its effect.
Technical Perspective: Bridging AI with Real-Time Systems
"Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines," by Shengzhong Liu et al., proposes a new methodology for overcoming the limitations of current AI frameworks to enable the use of deep neural networks in mission-critical systems.
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
In this paper, we prove the first superpolynomial lower bounds against algebraic circuits of all constant depths over all fields of characteristic 0.
Technical Perspective: How Easy Is It to Describe Hard Polynomials?
"Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits," by Nutan Limaye et al., achieves a landmark in the larger quest of understanding hardness, dentity testing, and reconstruction.
Nonverbal Communication through Expressive Objects
In this work, we work closely with an AAC user to understand how motion through a physical expressive object can support their communication.
The User as a Key Ingredient in AAC Design
"Nonverbal Communication through Expressive Objects," by Stephanie Valencia et al., describes the design of a physical object to support communication and focuses on the active involvement of an expert Augmentative and Alternative Communication (AAC) user as a member of the design team.
Maximum Flow Through a Network: A Storied Problem and a Groundbreaking Solution
“Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow,” by Li Chen et al., comes within striking distance of answering the question: “Does maximum flow have a scalable algorithm?”
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m1+o(1) time.
Technical Perspective: What’s All the Fuss about Fuzzing?
"Boosting Fuzzer Efficiency: An Information Theoretic Perspective," by Marcel Böhme, Valentin J.M. Manès, and Sang Kil Cha, presents a novel twist to fuzzing that is shown to increase the central metric of the number of bugs found.
Boosting Fuzzer Efficiency: An Information Theoretic Perspective
In this paper, we take the fundamental perspective of fuzzing as a learning process.
Locating Everyday Objects Using NFC Textiles
This paper builds a Near-Field Communication-based localization system that allows ordinary surfaces to locate surrounding objects with high accuracy in the near-field.
Leveraging Social Media to Buy Fake Reviews
We study the market for fake product reviews on Amazon.com.
"Locating Everyday Objects Using NFC Textiles," by Jingxian Wang et al., describes the potential of Near-Field Communication for advanced home automation.
Technical Perspective: A Rare Glimpse of Tracking Fake Reviews
"Leveraging Social Media to Buy Fake Reviews," by Sherry He et al., represents a breakthrough in our empirical understanding of fake reviews on Amazon.
Technical Perspective: Tapping the Link between Algorithmic Model Counting and Streaming
"Model Counting Meets Distinct Elements," by A. Pavan et al., gives a surprising connection between model counting and streaming, providing a generic transformation of data stream algorithms for F0 estimation to algorithms for model counting.
Model Counting Meets Distinct Elements
In this work, we seek to investigate whether bridging the seeming communication gap between two different domains of computer science may pave the way to richer fundamental insights.
A Manifold View of Connectivity in the Private Backbone Networks of Hyperscalers
We present a new empirical approach for elucidating connectivity in privately owned and operated backbone networks.
Mixed Abilities and Varied Experiences: A Group Autoethnography of a Virtual Summer Internship
Interns, full-time members, and affiliates of a Microsoft Research team focused on accessibility report on the experiences of virtual interns in 2020 navigating the challenges of working remotely.
Technical Perspective: Pandemics, Remote Work, and Accessibility
"Mixed Abilities and Varied Experiences: A Group Autoethnography of a Virtual Summer Internship," by Kelly Mack et al., provides guidance on how to make remote work and meetings work better for everyone.
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedBy opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
