142 search results - page 23 / 29 » Filtering for Subgraph Isomorphism |
131
click to vote
LPAR
2004
Springer
15 years 7 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
104
Voted
CVPR
2000
IEEE
15 years 6 months ago
2000
IEEE
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
132
click to vote
SPAA
2000
ACM
15 years 6 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
133
Voted
WG
1999
Springer
15 years 6 months ago
1999
Springer
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
127
Voted
EJC
2008
15 years 2 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...