430 search results - page 13 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
139
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
ECOOP
2007
Springer
15 years 9 months ago
2007
Springer
Data in object-oriented programming is organized in a hierarchy of classes. The problem of object-oriented pattern matching is how to explore this hierarchy from the outside. This ...
139
click to vote
BALT
2010
14 years 10 months ago
2010
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
116
click to vote
JDA
2011
14 years 10 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
117
click to vote
BIRD
2008
Springer
15 years 5 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...