acm-header
Sign In

Communications of the ACM

Latest Research



From Communications of the ACM

Technical Perspective: Progress in Visual Categorization

Our visual system helps us carry out our daily business. Our eyes and brain help us by measuring shapes, trajectories, and distances in world around us, and by...

Visual Object Detection with Deformable Part Models
From Communications of the ACM

Visual Object Detection with Deformable Part Models

We describe a state-of-the-art system for finding objects in cluttered images. Our system is based on deformable models that represent objects using local part...

From Communications of the ACM

Technical Perspective: Circuit Placement Challenges

For a semiconductor circuit with billions of transistors, finding desired locations of circuit components is a challenging task that substantially impacts circuit...

SimPL: An Algorithm For Placing VLSI Circuits
From Communications of the ACM

SimPL: An Algorithm For Placing VLSI Circuits

VLSI placement optimizes locations of circuit components so as to reduce interconnect. We propose an algorithm for large-scale placement that outperforms prior...

From Communications of the ACM

Technical Perspective: Visualization, Understanding, and Design

Photographs capture the moment; paintings convey perception, impression, and feeling; illustrations tell stories. Computer graphics aims to enrich all these artistic...

From Communications of the ACM

Illustrating How Mechanical Assemblies Work

How-things-work visualizations use a variety of visual techniques to depict the operation of complex mechanical assemblies. We present an automated approach for...

From Communications of the ACM

Technical Perspective: High-Level Data Structures

This lifting of data structure thinking to the relational level has long inspired computer scientists. In "An Introduction to Data Representation Synthesis," the...

An Introduction to Data Representation Synthesis
From Communications of the ACM

An Introduction to Data Representation Synthesis

We consider the problem of specifying combinations of data structures with complex sharing in a manner that is declarative and results in provably correct code.

From Communications of the ACM

Technical Perspective: SQL on an Encrypted Database

There is some risk in trusting the cloud providers with sensitive data. Why not encrypt the data stored in cloud services?

CryptDB: Processing Queries on an Encrypted Database
From Communications of the ACM

CryptDB: Processing Queries on an Encrypted Database

An ideal solution to satisfying the dual goals of protecting data confidentiality and running computations is to enable a server to compute over encrypted data,...

Searching the Village
From Communications of the ACM

Searching the Village: Models and Methods For Social Search

With Aardvark, a social search engine, users ask a question, either by IM, e-mail, Web input, text message, or voice. Aardvark then routes the question to the person...

From Communications of the ACM

Technical Perspective: Who Knows?: Searching For Expertise on the Social Web

It is difficult to remember what people had to do to find the answer to a question before the Web. One option might be to call a friend who might know the answer...

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...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account