acm-header
Sign In

Communications of the ACM

Latest Research



Convolution Engine
From Communications of the ACM

Convolution Engine: Balancing Efficiency and Flexibility in Specialized Computing

We present the Convolution Engine (CE) — a programmable processor specialized for the convolution-like data-flow prevalent in computational photography, computer...

From Communications of the ACM

Technical Perspective: Image Processing Goes Back to Basics

In "Local Laplacian Filters," Paris et al. made a surprising move. They chose to build a system on the Laplacian pyramid, which is a very simple multiscale representation...

Local Laplacian Filters
From Communications of the ACM

Local Laplacian Filters: Edge-Aware Image Processing with a Laplacian Pyramid

In this paper, we demonstrate that state-of-the-art edge-aware filters can be achieved with standard Laplacian pyramids.

From Communications of the ACM

Technical Perspective: The Equivalence Problem For Finite Automata

As the equivalence problem is essential in many applications, we need algorithms that avoid the worst-case complexity as often as possible. In "Hacking Nondeterminism...

Hacking Nondeterminism with Induction and Coinduction
From Communications of the ACM

Hacking Nondeterminism with Induction and Coinduction

We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata.

From Communications of the ACM

Technical Perspective: Big Data Needs Approximate Computing

"Neural Acceleration for General-Purpose Approximate Programs" demonstrates the significant advantages in cost, power, and latency through approximate computing...

Neural Acceleration For General-Purpose Approximate Programs
From Communications of the ACM

Neural Acceleration For General-Purpose Approximate Programs

This paper describes a new approach that uses machine learning-based transformations to accelerate approximation-tolerant programs.

From Communications of the ACM

Technical Perspective: Rethinking Caches For Throughput Processors

As GPUs have become mainstream parallel processing engines, many applications targeting GPUs now have data locality more amenable to traditional caching. The...

Learning Your Limit
From Communications of the ACM

Learning Your Limit: Managing Massively Multithreaded Caches Through Scheduling

This paper studies the effect of accelerating highly parallel workloads with significant locality on a massively multithreaded GPU.

From Communications of the ACM

Technical Perspective: The Intricate Dance of Fabric and Light

For years, graphics programs have simulated fabric as a collection of fibers, requiring tweaks to algorithms for each new fabric. "Building Volumetric Appearance...

Building Volumetric Appearance Models of Fabric Using Micro CT Imaging
From Communications of the ACM

Building Volumetric Appearance Models of Fabric Using Micro CT Imaging

Visualizing and rendering cloth has been an important area of graphics research for decades. This paper proposes a new approach to acquiring volume models, based...

From Communications of the ACM

Technical Perspective: Attacking a Problem from the Middle

"Dissection: A New Paradigm for Solving Bicomposite Search Problems," by Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir, presents an elegant new algorithm...

Dissection
From Communications of the ACM

Dissection: A New Paradigm For Solving Bicomposite Search Problems

In this paper, we introduce the new notion of bicomposite search problems, and show that they can be solved with improved combinations of time and space complexities...

From Communications of the ACM

Technical Perspective: Portraiture in the Age of Big Data

"Moving Portraits" is, in some sense, part of the perpetual quest to capture the perfect portrait. Its principal contribution is in adapting this age-old problem...

Moving Portraits
From Communications of the ACM

Moving Portraits

We present an approach for generating face animations from large image collections of the same person. By optimizing the quantity and order in which photos are...

From Communications of the ACM

Technical Perspective: Getting Consensus For Data Replication

The following paper is a breakthrough in which the authors offer a formula to calculate the probability of reading data that was not written by one of the K most...

Quantifying Eventual Consistency with PBS
From Communications of the ACM

Quantifying Eventual Consistency with PBS

Eventual consistency is often "good enough" for practitioners given its latency and availability benefits. In this work, we explain this phenomenon and demonstrate...

From Communications of the ACM

Technical Perspective: The Power of Joint Multiuser Beamforming

Having multiple Wi-Fi Access Points with an overlapping coverage area operating on the same frequency may not be a problem anymore.

JMB
From Communications of the ACM

JMB: Scaling Wireless Capacity with User Demands

JMB, a joint multiuser beamforming system, enables independent access points (APs) to beamform their signals and communicate with their clients on the same channel...

From Communications of the ACM

Technical Perspective: Motion Fields For Interactive Character Animation

The following paper effectively treats motion clips as a set of independent motion vectors. In their ensemble, these high-dimensional motion vectors define a...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account