1327 search results - page 149 / 266 » Path following algorithm for the graph matching problem |
152
Voted
SODA
1997
ACM
15 years 5 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
110
click to vote
IJRR
2008
15 years 3 months ago
2008
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
119
click to vote
FPGA
1997
ACM
15 years 8 months ago
1997
ACM
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
151
click to vote
GEOS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Conceptual Graphs are a very powerful knowledge and meaning representation formalism grounded on deep philosophical, linguistic and object oriented principles [1], [2]. C...
120
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...