The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
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.
"Graph partitioning" refers to a family of computational problems in which the vertices of a graph have to be partitioned into two (or more) large pieces while minimizing the number…
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.
Arora, Rao, and Vazirani discuss the most important developments in approximation algorithms over the last two decades.