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
TxLinux is the first operating system to use hardware transactional memory (HTM) as a synchronization primitive, and the first to manage HTM in the scheduler. TxLinux...Christopher J. Rossbach, Hany E. Ramadan, Owen S. Hofmann, Donald E. Porter, Aditya Bhandari, Emmett Witchel From Communications of the ACM | September 2008
Computer science has long had a solid foundation for evaluating the performance of algorithms. The asymptotic...William Pugh From Communications of the ACM | August 2008
In computer science, when we say "time is money," we typically refer to two types of time that determine the costs and benefits...Nir Shavit From Communications of the ACM | August 2008
In this paper we present a concurrency model based on transactional memory. All the usualblocking and choice...Tim Harris, Simon Marlow, Simon Peyton Jones, Maurice Herlihy From Communications of the ACM | August 2008
Evaluation methodology underpins all innovation in experimental computer science. It requires relevant workloads, appropriate experimental design, and rigorous...Stephen M. Blackburn, Kathryn S. McKinley, Robin Garner, Chris Hoffmann, Asjad M. Khan, Rotem Bentzur, Amer Diwan, Daniel Feinberg, Daniel Frampton, Samuel Z. Guyer, Martin Hirzel, Antony Hosking, Maria Jump, Han Lee, J. Eliot B. Moss, Aashish Phansalkar, Darko Stefanovik, Thomas VanDrunen, Daniel von Dincklage, Ben Wiedermann From Communications of the ACM | August 2008
The following paper by researcher David Shaw and colleagues describes their Anton molecular dynamics engine....Bob Colwell From Communications of the ACM | July 2008
The ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macro-molecules could in principle provide answers...David E. Shaw, Martin M. Deneroff, Ron O. Dror, Jeffrey S. Kuskin, Richard H. Larson, John K. Salmon, Cliff Young, Brannon Batson, Kevin J. Bowers, Jack C. Chao, Michael P. Eastwood, Joseph Gagliardo, J. P. Grossman, C. Richard Ho, Douglas J. Ierardi, István Kolossváry, John L. Klepeis, Timothy Layman, Christine McLeavey, Mark A. Moraes, Rolf Mueller, Edward C. Priest, Yibing Shan, Jochen Spengler, Michael Theobald, Brian Towles, Stanley C. Wang From Communications of the ACM | July 2008
The wireless sensor network community approached networking abstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm...Philip Levis, Eric Brewer, David Culler, David Gay, Samuel Madden, Neil Patel, Joe Polastre, Scott Shenker, Robert Szewczyk, Alec Woo From Communications of the ACM | July 2008
Wireless sensor networks represent a new computing platform that blends computation, sensing, and communication...Feng Zhao From Communications of the ACM | July 2008