3105 search results - page 194 / 621 » The Path-Packing Structure of Graphs |
108
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nod...
131
Voted
CAI
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
129
Voted
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest [15]. A...
144
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics, and graphs...
103
Voted
IJCAI
2001
15 years 5 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...