4074 search results - page 265 / 815 » Abstract Graph Transformation |
190
click to vote
MFCS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
147
click to vote
GG
2008
Springer
15 years 7 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...
161
click to vote
ICRA
2010
IEEE
15 years 5 months 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...
281
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
209
click to vote
COMPGEOM
2011
ACM
14 years 10 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...