Sciweavers

1700 search results - page 180 / 340
» Combinatorial Pattern Matching
Sort
View
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 10 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
HICSS
2009
IEEE
119views Biometrics» more  HICSS 2009»
14 years 5 months ago
Using Graphics Processors for Parallelizing Hash-Based Data Carving
The ability to detect fragments of deleted image files and to reconstruct these image files from all available fragments on disk is a key activity in the field of digital forensic...
Sylvain Collange, Yoginder S. Dandass, Marc Daumas...
AINA
2008
IEEE
14 years 4 months ago
Improved TCAM-Based Pre-Filtering for Network Intrusion Detection Systems
—With the increasing growth of the Internet, the explosion of attacks and viruses significantly affects the network security. Network Intrusion Detection System (NIDS) is develop...
Yeim-Kuan Chang, Ming-Li Tsai, Cheng-Chien Su
COMSIS
2007
206views more  COMSIS 2007»
13 years 10 months ago
Building an Advanced Invariant Real-Time Human Tracking System
Real-time human tracking is very important in surveillance and robot applications. We note that the performance of any human tracking system depends on its accuracy and its ability...
Fayez Idris, Mazen Abu-Zaher, Rashad J. Rasras, Ib...
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
14 years 4 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...