1493 search results - page 185 / 299 » Local resilience of graphs |
90
Voted
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
113
Voted
ICCV
2007
IEEE
15 years 7 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
89
Voted
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...
100
Voted
GG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Adhesive high-level replacement (HLR) categories and systems are introduced as a new categorical framework for graph transformation in a broad sense, which combines the w...
CVPR
1997
IEEE
15 years 5 months ago
1997
IEEE
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...