Sciweavers

3791 search results - page 142 / 759
» Packing sets of patterns
Sort
View
FCT
2005
Springer
15 years 8 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood
PKDD
2005
Springer
110views Data Mining» more  PKDD 2005»
15 years 8 months ago
k-Anonymous Patterns
It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in orde...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
CINQ
2004
Springer
177views Database» more  CINQ 2004»
15 years 8 months ago
Generic Pattern Mining Via Data Mining Template Library
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Templat...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Paol...
GREC
2009
Springer
15 years 7 months ago
Symbol Recognition Using a Concept Lattice of Graphical Patterns
Abstract. In this paper we propose a new approach to recognize symbols by the use of a concept lattice. We propose to build a concept lattice in terms of graphical patterns. Each m...
Marçal Rusiñol, Karell Bertet, Jean-...
FCCM
2004
IEEE
96views VLSI» more  FCCM 2004»
15 years 7 months ago
Pre-Decoded CAMs for Efficient and High-Speed NIDS Pattern Matching
In this paper we advocate the use of pre-decoding for CAM-based pattern matching. We implement an FPGA based sub-system for NIDS (Snort) pattern matching using a combination of te...
Ioannis Sourdis, Dionisios N. Pnevmatikatos