115 search results - page 14 / 23 » Versioning Tree Structures by Path-Merging |
DCC
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
139
click to vote
SLS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
107
click to vote
ISAAC
2001
Springer
15 years 6 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
108
click to vote
NIPS
2004
15 years 3 months ago
2004
Go is an ancient oriental game whose complexity has defeated attempts to automate it. We suggest using probability in a Bayesian sense to model the uncertainty arising from the va...
133
click to vote
WLP
1997
Springer
15 years 6 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...