Autonomous helicopter flight is widely regarded to be a highly challenging control problem. As helicopters are highly unstable and exhibit complicated dynamical...Adam Coates, Pieter Abbeel, Andrew Y. Ng From Communications of the ACM | July 2009
In one scene from The Matrix, two leaders of the human resistance are trapped on the roof of a skyscraper. The only means of escape is by helicopter, which neither...Stuart Russell, Lawrence Saul From Communications of the ACM | July 2009
Modern computer systems are inherently nondeterministic due to a variety of events that occur during an execution. The lack of repeatability that arises from this...Derek R. Hower, Pablo Montesinos, Luis Ceze, Mark D. Hill, Josep Torrellas From Communications of the ACM | June 2009
Many Web sites embed third-party content in frames, relying on the browser's security policy to protect against malicious content. However, frames provide insufficient...Adam Barth, Collin Jackson, John C. Mitchell From Communications of the ACM | June 2009
The web has brought exciting new functionality while simultaneously requiring new mechanisms to make it secure. We've...Andrew Myers From Communications of the ACM | June 2009
DRAM retains its contents for several seconds after power is lost. Although DRAM becomes less reliable when it is not refreshed, it is not immediately erased, and...J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, Edward W. Felten From Communications of the ACM | May 2009
Many systems rely on keeping a master key secret. But technological progress can undermine old assumptions.Ross Anderson From Communications of the ACM | May 2009
In this paper, we examine the use of Flash storage in the server domain. Wear-out has the potential to limit the use of Flash in this domain. To seriously consider...David Roberts, Taeho Kgil, Trevor Mudge From Communications of the ACM | April 2009
Flash memory nowadays seems to be in every discussion about system architecture. Sure enough, flash memory boasts...Goetz Graefe From Communications of the ACM | April 2009
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
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
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
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