acm-header
Sign In

Communications of the ACM

Latest Research



Wherefore Art Thou R3579X?
From Communications of the ACM

Wherefore Art Thou R3579X?: Anonymized Social Networks, Hidden Patterns, and Structural Steganography

In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. We describe a family of attacks such...

From Communications of the ACM

Technical Perspective: A Perfect 'Match'

In a breakthrough contribution, the authors of the paper that follows have developed an efficient way to find approximate nearest neighbors for the case of database...

The Patchmatch Randomized Matching Algorithm For Image Manipulation
From Communications of the ACM

The Patchmatch Randomized Matching Algorithm For Image Manipulation

This paper presents a new randomized algorithm for quickly finding approximate nearest neighbor matches between image patches. Our algorithm offers substantial...

From Communications of the ACM

Technical Perspective: A Better Way to Learn Features

A typical machine learning program uses weighted combinations of features to discriminate between classes or to predict...

Unsupervised Learning of Hierarchical Representations with Convolutional Deep Belief Networks
From Communications of the ACM

Unsupervised Learning of Hierarchical Representations with Convolutional Deep Belief Networks

There has been much interest in unsupervised learning of hierarchical generative models such as deep belief networks (DBNs); however, scaling such models to full...

From Communications of the ACM

Technical Perspective: Visual Reconstruction

Nearly 460,000 Flickr pictures were used to create detailed three-dimensional geometry and colors of famous landmarks and...

Building Rome in a Day
From Communications of the ACM

Building Rome in a Day

We present a system that can reconstruct 3D geometry from large, unorganized collections of photographs. Our experimental results demonstrate that it is possible...

From Communications of the ACM

Technical Perspective: Making Browser Extensions Secure

Vulnerabilities in browsers and their extensions have become the primary venue through which cyber criminals compromise the security...

Vetting Browser Extensions For Security Vulnerabilities with VEX
From Communications of the ACM

Vetting Browser Extensions For Security Vulnerabilities with VEX

The browser has become the de facto platform for everyday computation and a popular target for attackers of computer systems. Among the many potential attacks that...

From Communications of the ACM

Technical Perspective: Sketches Get Sketchier

Are data synopses — such as the hash-based sketches discussed by Li and König — still needed for querying massive...

Theory and Applications of <i>b</i>-Bit Minwise Hashing
From Communications of the ACM

Theory and Applications of b-Bit Minwise Hashing

Efficient (approximate) computation of set similarity in very large datasets is a common task with many applications inminwise hashing...

From Communications of the ACM

Technical Perspective: FAWN: A Fast Array of Wimpy Nodes

The emergence of wimpy processors and FLASH met a promising deployment scenario in the field of large-scale data centers. The energy efficiency potential of these...

FAWN
From Communications of the ACM

FAWN: A Fast Array of Wimpy Nodes

This paper presents a fast array of wimpy nodes — FAWN — an approach for achieving low-power data-intensive data-center computing.

Dremel: Interactive Analysis of Web-Scale Datasets
From Communications of the ACM

Dremel: Interactive Analysis of Web-Scale Datasets

Dremel is a scalable, interactive ad hoc query system for analysis of read-only nested data. By combining multilevel execution trees and columnar data layout, it...

From Communications of the ACM

Technical Perspective: Data Analysis at Astonishing Speed

The importance of data analysis has never been clearer. Globe-spanning scientific collaborations are exploring...

From Communications of the ACM

Technical Perspective: The Quest For a Logic For Polynomial-Time Computation

The interaction between computation and logic goes back to the beginnings of computer science with the development of computability theory...

From Polynomial Time Queries to Graph Structure Theory
From Communications of the ACM

From Polynomial Time Queries to Graph Structure Theory

We give a logical characterization of the polynomial-time properties of graphs with excluded minors.

Self-Similarity-Based Image Denoising
From Communications of the ACM

Self-Similarity-Based Image Denoising

The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication...

From Communications of the ACM

Technical Perspective: Images Everywhere Looking For Models

About 5,000 images per minute are uploaded to the photo-sharing site http://www.flickr.com/; over...

From Communications of the ACM

Technical Perspective: Complex Financial Products: Caveat Emptor

CDOs are examples of financial derivatives, with a value that depends on the underlying assets with which they are linked. These kinds of complex financial products...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account