689 search results - page 46 / 138 » A Modal-Logic Based Graph Abstraction |
GG
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
106
click to vote
ICRA
2010
IEEE
15 years 3 days ago
2010
IEEE
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
142
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
CAV
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
101
Voted
SEMWEB
2007
Springer
15 years 7 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...