Sciweavers

605 search results - page 76 / 121
» Constrained Graph Layout
Sort
View
CVPR
2010
IEEE
14 years 5 months ago
Dense Non-rigid Surface Registration Using High-Order Graph Matching
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...
AUIC
2006
IEEE
14 years 4 months ago
Fluid sketching of directed graphs
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...
James Arvo, Kevin Novins
CP
2005
Springer
14 years 3 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
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...
Grégoire Dooms, Yves Deville, Pierre Dupont
KI
2005
Springer
14 years 3 months ago
Temporalizing Spatial Calculi: On Generalized Neighborhood Graphs
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...
Marco Ragni, Stefan Wölfl
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 10 months ago
Constraint models for graceful graphs
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...
Barbara M. Smith, Jean-François Puget