Sciweavers

906 search results - page 16 / 182
» Matching Subsequences in Trees
Sort
View
PAMI
2007
166views more  PAMI 2007»
13 years 7 months ago
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
Dariu Gavrila
JCB
2008
122views more  JCB 2008»
13 years 7 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
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...
Enno Ohlebusch, Stefan Kurtz
PR
2008
145views more  PR 2008»
13 years 7 months ago
Probabilistic suffix models for API sequence analysis of Windows XP applications
Given the pervasive nature of malicious mobile code (viruses, worms, etc.), developing statistical/structural models of code execution is of considerable importance. We investigat...
Geoffrey Mazeroff, Jens Gregor, Michael G. Thomaso...
ICDE
2004
IEEE
139views Database» more  ICDE 2004»
14 years 9 months ago
Engineering a Fast Online Persistent Suffix Tree Construction
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 ...
Srikanta J. Bedathur, Jayant R. Haritsa
GD
2007
Springer
14 years 1 months ago
Minimum Level Nonplanar Patterns for Trees
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...
J. Joseph Fowler, Stephen G. Kobourov