564 search results - page 28 / 113 » Error-tolerant Tree Matching |
106
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
110
click to vote
ECML
2005
Springer
15 years 7 months ago
2005
Springer
We propose an omnivariate decision tree architecture which contains univariate, multivariate linear or nonlinear nodes, matching the complexity of the node to the complexity of the...
76
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
SEMWEB
2007
Springer
15 years 7 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
119
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...