Sciweavers

419 search results - page 19 / 84
» First Order Paths in Ordered Trees
Sort
View
AINA
2008
IEEE
14 years 4 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
ANTSW
2004
Springer
14 years 3 months ago
Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
James Montgomery, Marcus Randall, Tim Hendtlass
ICCAD
1994
IEEE
114views Hardware» more  ICCAD 1994»
14 years 1 months ago
Performance-driven synthesis of asynchronous controllers
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
14 years 1 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 3 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler