Sciweavers

4137 search results - page 67 / 828
» On the number of matchings of a tree
Sort
View
FOSSACS
2003
Springer
15 years 7 months ago
Manipulating Trees with Hidden Labels
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...
Luca Cardelli, Philippa Gardner, Giorgio Ghelli
SIGSOFT
2007
ACM
16 years 2 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
109
Voted
FOSSACS
2009
Springer
15 years 8 months ago
Dependency Tree Automata
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...
Colin Stirling
AINA
2008
IEEE
15 years 8 months ago
Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System
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,...
Min-Feng Wang, Yen-Ching Wu, Meng-Feng Tsai
ECML
2005
Springer
15 years 7 months ago
Model Selection in Omnivariate Decision Trees
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...
Olcay Taner Yildiz, Ethem Alpaydin