A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...
Current content-based video copy detection approaches mostly concentrate on the visual cues and neglect the audio information. In this paper, we attempt to tackle the video copy d...
Yang Liu, Wanlei Zhao, Chong-Wah Ngo, Changsheng X...
In this paper, we present a binarization technique specifically designed for historical document images. Existing methods for this problem focus on either finding a good global th...
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...