Machine Learning today offers a broad repertoire of methods for classification and regression. But what if we need to predict complex objects like trees, orderings...Thorsten Joachims, Thomas Hofmann, Yisong Yue, Chun-Nam Yu From Communications of the ACM | November 2009
Interest in machine learning can be traced back to the early days of computer science. Alan Turing himself conjectured that...John Shawe-Taylor From Communications of the ACM | November 2009
Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to...Boon Thau Loo, Tyson Condie, Minos Garofalakis, David E. Gay, Joseph M. Hellerstein, Petros Maniatis, Raghu Ramakrishnan, Timothy Roscoe, Ion Stoica From Communications of the ACM | November 2009
In science, significant advances are often made when researchers from different communities join forces.Peter Druschel From Communications of the ACM | November 2009
Many data generation processes can be modeled as data streams. While this data may be archived and indexed within a data warehouse, it is also important to process...Graham Cormode, Marios Hadjieleftheriou From Communications of the ACM | October 2009
The database and systems communities have made great progress in developing database systems that allow us to store and query huge amounts of data. Real-time analysis...Johannes Gehrke From Communications of the ACM | October 2009
The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. We provide...Kevin Beyer, Rainer Gemulla, Peter J. Haas, Berthold Reinwald, Yannis Sismanis From Communications of the ACM | October 2009
Relational systems have made it possible to query large collections of data in a declarative style through languages such as SQL. There is a key component that...Surajit Chaudhuri From Communications of the ACM | October 2009
Writing software for multicore processors is greatly simplified if we could automatically parallelize sequential programs. Although auto-parallelization has been...Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew From Communications of the ACM | September 2009
Looking for some new insight into an old problem? The familiar problem of writing parallel applications and a...Katherine Yelick From Communications of the ACM | September 2009
Existing literature on distributed development in software engineering and other fields discusses various challenges,...Christian Bird, Nachiappan Nagappan, Premkumar Devanbu, Harald Gall, Brendan Murphy From Communications of the ACM | August 2009
It was a problem that should not have taken three weeks to solve. The documentation claimed that if a function was called...James Herbsleb From Communications of the ACM | August 2009
This paper reports on the development and formal verification of CompCert, a compiler from Clight (a large subset of the C programming language) to PowerPC assembly...Xavier Leroy From Communications of the ACM | July 2009
In the early 1970s, pioneers like Floyd, Dijkstra, and Hoare argued that programs should be formally specified and proven...Greg Morrisett From Communications of the ACM | July 2009
In a thread-safe concurrent queue, consumers typically wait for producers to make data available. In a synchronous queue, producers similarly wait for consumers...William N. Scherer, Doug Lea, Michael L. Scott From Communications of the ACM | May 2009
The advent of multicore architectures has produced a Renaissance in the study of highly concurrent data structures.Maurice Herlihy From Communications of the ACM | May 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