Solving Sparse Linear Systems Faster than Matrix Multiplication
In this paper, we present an algorithm that solves linear systems with sparse coefficient matrices asymptotically faster than matrix multiplication for any ω > 2.
Solving Sparse Linear Systems Faster than Matrix Multiplication
In this paper, we present an algorithm that solves linear systems with sparse coefficient matrices asymptotically faster than matrix multiplication for any ω > 2.
Technical Perspective: Solve for x
Peng and Vempala have pushed through a barrier that has stood for decades. How far will their momentum carry us?
Technical Perpective: Looking Ahead at Inclusive Technology
A generative AI technology designed to support people with dyslexia.
LaMPost: AI Writing Assistance for Adults with Dyslexia Using Large Language Models
Researchers present LaMPost, an email-writing tool with the potential to support dyslexic users.
Technical Perspective: Tracing the Network Traffic Fingerprinting Techniques of OpenVPN
"OpenVPN is Open to VPN Fingerprinting," by Diwen Xue et al., investigates network traffic fingerprinting of a very popular privacy technique—OpenVPN.
Technical Perspective: The Software-Centric Approach of SYNERGY
The advantages of a software rather than hardware approach to FPGA virtualization.
Compiler-Driven FPGA Virtualization with SYNERGY
SYNERGY virtualizes FPGAs to be used effectively in datacenters.
Technical Perspective: Creating the Internet of Biological and Bio-Inspired Things
"mSAIL: Milligram-Scale Multi-modal Sensor Platform for Monarch Butterfly Migration Tracking," by Inhee Lee et al., describes a critical milestone in the mobile system community’s efforts toward creating the Internet of biological things.
mSAIL: Milligram-Scale Multi-Modal Sensor Platform for Monarch Butterfly Migration Tracking
We propose a wireless sensing platform, mSAIL, specifically designed for a monarch butterfly migration study based on previously developed custom-designed ICs.
Dynamic Placement in Refugee Resettlement
In this paper, we design an online algorithm for refugee allocation.
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.
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