218 search results - page 14 / 44 » Local Properties of Triangular Graphs |
127
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
136
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper, we propose a robust and efficient Lagrangian approach, which we call Delaunay Deformable Models, for modeling moving surfaces undergoing large deformations and topo...
159
click to vote
IMR
2004
Springer
15 years 9 months ago
2004
Springer
A surface is often approximated by a network of triangular facets. In the absence of a precise mathematical description of the underlying surface all information about surface pro...
142
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
153
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...