1154 search results - page 82 / 231 » On the editing distance of graphs |
ATAL
2005
Springer
14 years 3 months ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
ECCV
2008
Springer
14 years 12 months ago
2008
Springer
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...
ICSM
2009
IEEE
14 years 4 months ago
2009
IEEE
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
WG
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
AIPS
2008
14 years 9 days ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...