This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
The result of a scene manipulation is usually displayed by rerendering the entire image even if the change has affected only a small portion of it. This paper presents a system th...
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...