Swift is a new, principled approach to building Web applications that are secure by construction. Swift automatically partitions application code while providing...Stephen Chong, Jed Liu, Andrew C. Myers, Xin Qi, K. Vikram, Lantian Zheng, Xin Zheng From Communications of the ACM | February 2009
Back in the old days of the Web (before 1995), Web browsers were fairly simple devices. The server's Web interface was simple enough that an auditor could at least...Dan Wallach From Communications of the ACM | February 2009
This article describes mechanisms for asynchronous collaboration in the context of information visualization, recasting visualizations as not just analytic tools...Jeffrey Heer, Fernanda B. Viégas, Martin Wattenberg From Communications of the ACM | January 2009
Visual analysis, a powerful method for finding and telling stories with data, is moving from research into widespread use.Jock D. Mackinlay From Communications of the ACM | January 2009
Traditional image resizing techniques are oblivious to the content of the image when changing its width or height. In contrast, media (i.e., image and video) retargeting...Ariel Shamir, Shai Avidan From Communications of the ACM | January 2009
A mind-boggling array of displays differ greatly in resolutions and aspect ratios. But images and videos are captured at fixed resolutions and aspect ratios, and...Harry Shum From Communications of the ACM | January 2009
C programmers are are all too familiar with out-of-bounds memory errors. The paper here presents an intriguing technique for...Martin C. Rinard From Communications of the ACM | December 2008
Beginning in the early to mid-1980s the relational model of data has dominated the DBMS landscape. Moreover, descendents of...Michael Stonebraker From Communications of the ACM | December 2008
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. We present Exterminator, a system that automatically...Gene Novark, Emery D. Berger, Benjamin G. Zorn From Communications of the ACM | December 2008
In this paper, we report how research around the MonetDB database system has led to a redesign of database architecture in order to take advantage of modern hardware...Peter A. Boncz, Martin L. Kersten, Stefan Manegold From Communications of the ACM | December 2008
In this paper, we address these demands by presenting the Polaris formalism, a visual query language for precisely describing a wide range of table-based graphical...Chris Stolte, Diane Tang, Pat Hanrahan From Communications of the ACM | November 2008
Users need storage that is highly reliable (it is not lost) and highly available (accessible when needed). Guaranteeing...Barbara Liskov From Communications of the ACM | November 2008
Jim Gray nominated the Polaris paper for the Research Highlights section and wrote the first draft of this Technical Perspective in November 2006. David Patterson...Jim Gray From Communications of the ACM | November 2008
A longstanding vision in distributed systems is to build reliable systems from unreliable components. An enticing formulation of this vision is Byzantine fault-tolerant...Ramakrishna Kotla, Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin From Communications of the ACM | November 2008
This paper wil strike a familiar chord with anyone who has ever taken a picture. The problem is easy to understand— replacing unwanted parts of a photograph.Marc Levoy From Communications of the ACM | October 2008
"Graph partitioning" refers to a family of computational problems in which the vertices of a graph have to be partitioned...Sanjeev Arora, Satish Rao, Umesh Vazirani From Communications of the ACM | October 2008
What can you do with a million images? In this paper, we present a new image completion algorithm powered by a huge database of photographs gathered from the Web...James Hays, Alexei A. Efros From Communications of the ACM | October 2008
Arora, Rao, and Vazirani discuss the most important developments in approximation algorithms over the last two decades.Éva Tardos From Communications of the ACM | October 2008
The long tradition of building ever-faster processors is ending, with the computer industry instead putting more...Mark Moir From Communications of the ACM | September 2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes...Fabian Kuhn, Thomas Locher, Roger Wattenhofer From Communications of the ACM | September 2008