279 search results - page 12 / 56 » Tree Pattern Rewriting Systems |
150
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
131
click to vote
FLOPS
2004
Springer
15 years 10 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
168
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
159
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
165
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...