430 search results - page 3 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
DASFAA
2007
IEEE
14 years 2 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
RTA
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
EMMCVPR
2001
Springer
14 years 16 days ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...