589 search results - page 33 / 118 » Matching Concavity Trees |
FOSSACS
2003
Springer
15 years 2 months ago
2003
Springer
We define an operational semantics and a type system for manipulating semistructured data that contains hidden information. The data model is simple labeled trees with a hiding op...
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
74
Voted
AINA
2008
IEEE
15 years 4 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,...
ECML
2005
Springer
15 years 3 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...
54
Voted
BIRTHDAY
2010
Springer
15 years 1 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...