1862 search results - page 127 / 373 » Constrained pattern matching |
104
click to vote
ICAPR
2005
Springer
15 years 6 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
74
Voted
SEMWEB
2009
Springer
15 years 7 months ago
2009
Springer
State of the art ontology matching techniques are limited to detect simple correspondences between atomic concepts and properties. Nevertheless, for many concepts and properties at...
104
click to vote
DATE
2008
IEEE
15 years 7 months ago
2008
IEEE
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
122
click to vote
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
83
Voted
CVIU
1999
15 years 21 days ago
1999
In this paper we consider the task of matching patterns, as occur in hand-drawn symbols and schematic diagrams, by their parts and relationships. Of particular interest for comput...