In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Di...
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...