23 search results - page 3 / 5 » A Polynomial-Time Algorithm for the Matching of Crossing Con... |
GBRPR
2007
Springer
13 years 11 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
CAL
2002
13 years 5 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
ICIP
2001
IEEE
14 years 7 months ago
2001
IEEE
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...