906 search results - page 16 / 182 » Matching Subsequences in Trees |
81
Voted
PAMI
2007
14 years 9 months ago
2007
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
JCB
2008
14 years 9 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
PR
2008
14 years 9 months ago
2008
Given the pervasive nature of malicious mobile code (viruses, worms, etc.), developing statistical/structural models of code execution is of considerable importance. We investigat...
155
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
GD
2007
Springer
15 years 3 months ago
2007
Springer
We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...