1056 search results - page 118 / 212 » Constraint-Based Graph Matching |
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
— We describe algorithms to build self-assembling robot systems composed of active modular robots and passive bars. The distributed algorithms are based on locally optimal matchi...
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
EMNLP
2007
13 years 10 months ago
2007
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
ALGORITHMICA
2010
13 years 9 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
COMBINATORICA
2008
13 years 9 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...