Sign In

Communications of the ACM

Latest Research



From Communications of the ACM

Technical Perspective: Making Sleep Tracking More User Friendly

"LIBS: A Bioelectrical Sensing System from Human Ears for Staging Whole-Night Sleep Study" provides a nice balance in terms of minimizing the burden on users and...

LIBS
From Communications of the ACM

LIBS: A Bioelectrical Sensing System from Human Ears for Staging Whole-Night Sleep Study

We explore a new form of wearable systems, called LIBS, that can continuously record biosignals such as brain wave, eye movements, and facial muscle contractions...

From Communications of the ACM

Technical Perspective: The Future of MPI

"Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided" convincingly shows that the potential of MPI one-sided communication can be realized...

Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided
From Communications of the ACM

Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided

In this work, we design and develop bufferless protocols that demonstrate how to implement the MPI-3 RMA interface and support scaling to millions of cores.

From Communications of the ACM

Technical Perspective: Graphs, Betweenness Centrality, and the GPU

"Accelerating GPU Betweenness Centrality" by McLaughlin and Bader ably addresses the challenges to authors of efficient graph implementations in the important context...

Accelerating GPU Betweenness Centrality
From Communications of the ACM

Accelerating GPU Betweenness Centrality

We present a hybrid GPU implementation that provides good performance on graphs of arbitrary structure rather than just scale-free graphs as was done previously...

From Communications of the ACM

Technical Perspective: The Rewards of Selfish Mining

"Majority Is Not Enough: Bitcoin Mining Is Vulnerable," by Eyal and Sirer, questions the 2009 Bitcoin white paper's implicit assumption of perfect information—that...

Majority Is Not Enough
From Communications of the ACM

Majority Is Not Enough: Bitcoin Mining Is Vulnerable

We propose a practical modification to the Bitcoin protocol that protects Bitcoin in the general case.

From Communications of the ACM

Technical Perspective: Breaking the Mold of Machine Learning

"Never-Ending Learning" is the latest and one of the most compelling incarnations of Tom Mitchell and his collaborators' research investigating how to broaden the...

Never-Ending Learning
From Communications of the ACM

Never-Ending Learning

In this paper we define more precisely the never-ending learning paradigm for machine learning, and present one case study: the Never-Ending Language Learner (NELL)...

From Communications of the ACM

Technical Perspective: Expressive Probabilistic Models and Scalable Method of Moments

The authors of "Learning Topic Models—Provably and Efficiently," developed a new method for fitting topic models and at large scale.

Learning Topic Models – Provably and Efficiently
From Communications of the ACM

Learning Topic Models – Provably and Efficiently

This article shows that some new theoretical algorithms that have provable guarantees can be adapted to yield highly practical tools for topic modeling.

From Communications of the ACM

Technical Perspective: A Graph-Theoretic Framework Traces Task Planning

In "Time-Inconsistent Planning: A Computational Problem in Behavioral Economics," Kleinberg and Oren describe a graph-theoretic framework for task planning with...

Time-Inconsistent Planning
From Communications of the ACM

Time-Inconsistent Planning: A Computational Problem in Behavioral Economics

We propose a graph-theoretic model of tasks and goals, in which dependencies among actions are represented by a directed graph, and a time-inconsistent agent constructs...

From Communications of the ACM

Technical Perspective: Designing Algorithms and the Fairness Criteria They Should Satisfy

"Which Is the Fairest (Rent Division) of Them All?" focuses on the problem of rent division, and stands out in the variety of techniques applied to arrive at a...

Which Is the Fairest (Rent Division) of Them All?
From Communications of the ACM

Which Is the Fairest (Rent Division) of Them All?

What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation...

From Communications of the ACM

Technical Perspective: Can High Performance Be Portable?

"Halide: Decoupling Algorithms from Schedules for High-Performance Image Processing" by Ragan-Kelley et al. on the image processing language Halide explores a substantially...

Halide
From Communications of the ACM

Halide: Decoupling Algorithms from Schedules For High-Performance Image Processing

We propose a new programming language for image processing pipelines, called Halide, that separates the algorithm from its schedule.

From Communications of the ACM

Technical Perspective: Moving Spectrum

The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...

Deep Optimization For Spectrum Repacking
From Communications of the ACM

Deep Optimization For Spectrum Repacking

This paper describes the process by which we built the SAT-based Feasibility Checker, a crucial element of the 2016-17 U.S. FCC "incentive auction" design.
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account