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...Damon Horowitz, Sepandar D. Kamvar From Communications of the ACM | April 2012
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...Ed H. Chi From Communications of the ACM | April 2012
Nearly 460,000 Flickr pictures were used to create detailed three-dimensional geometry and colors of famous landmarks and...Carlo Tomasi From Communications of the ACM | October 2011
We present a system that can reconstruct 3D geometry from large, unorganized collections of photographs. Our experimental results demonstrate that it is possible...Sameer Agarwal, Yasutaka Furukawa, Noah Snavely, Ian Simon, Brian Curless, Steven M. Seitz, Richard Szeliski From Communications of the ACM | October 2011
Vulnerabilities in browsers and their extensions have become the primary venue through which cyber criminals compromise the security...Christopher Kruegel From Communications of the ACM | September 2011
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...Sruthi Bandhakavi, Nandit Tiku, Wyatt Pittman, Samuel T. King, P. Madhusudan, Marianne Winslett From Communications of the ACM | September 2011
Two critical goals for mobile devices seem intrinsically in conflict. For carrying, the smaller the better. Yet for...Scott Klemmer From Communications of the ACM | August 2011
Skinput is a technology that appropriates the skin as an input surface by analyzing mechanical vibrations that propagate through the body. Specifically, we resolve...Chris Harrison, Desney Tan, Dan Morris From Communications of the ACM | August 2011
Are data synopses — such as the hash-based sketches discussed by Li and König — still needed for querying massive...Peter J. Haas From Communications of the ACM | August 2011
Efficient (approximate) computation of set similarity in very large datasets is a common task with many applications inminwise hashing...Ping Li, Arnd Christian König From Communications of the ACM | August 2011
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...Luiz André Barroso From Communications of the ACM | July 2011
This paper presents a fast array of wimpy nodes — FAWN — an approach for achieving low-power data-intensive data-center computing.
David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan From Communications of the ACM | July 2011
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...Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis From Communications of the ACM | June 2011
The importance of data analysis has never been clearer. Globe-spanning scientific collaborations are exploring...Michael J. Franklin From Communications of the ACM | June 2011
The interaction between computation and logic goes back to the beginnings of computer science with the development of computability theory...Phokion G. Kolaitis From Communications of the ACM | June 2011
We give a logical characterization of the polynomial-time properties of graphs with excluded minors.Martin Grohe From Communications of the ACM | June 2011
A system for musical accompaniment is presented in which a computer-driven orchestra follows and learns from a soloist in a concerto-like setting. The system's...Christopher Raphael From Communications of the ACM | March 2011
In the opening of Sibelius' Violin Concerto, a soloist plays delicately. The orchestra responds in kind. As...Juan Bello, Yann LeCun, Robert Rowe From Communications of the ACM | March 2011
While a large body of work exists on DRAM in lab conditions, little has been reported on real DRAM failures in large production clusters. In this paper, we analyze...Bianca Schroeder, Eduardo Pinheiro, Wolf-Dietrich Weber From Communications of the ACM | February 2011
In order to advance the field, knowledge of the types of memory errors at the system level, their frequencies, and conditions that exacerbate or are unrelated to...Norman P. Jouppi From Communications of the ACM | February 2011