Sciweavers

995 search results - page 48 / 199
» String Pattern Discovery
Sort
View
JIIS
1998
161views more  JIIS 1998»
13 years 7 months ago
Mining Text Using Keyword Distributions
Knowledge Discovery in Databases (KDD) focuses on the computerized exploration of large amounts of data and on the discovery of interesting patterns within them. While most work on...
Ronen Feldman, Ido Dagan, Haym Hirsh
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
14 years 1 months ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi
FCCM
2009
IEEE
115views VLSI» more  FCCM 2009»
13 years 11 months ago
Multi-Core Architecture on FPGA for Large Dictionary String Matching
FPGA has long been considered an attractive platform for high performance implementations of string matching. However, as the size of pattern dictionaries continues to grow, such ...
Qingbo Wang, Viktor K. Prasanna
ICST
2009
IEEE
14 years 2 months ago
Seasonal Variation in the Vulnerability Discovery Process
Vulnerability discovery rates need to be taken into account for evaluating security risks. Accurate projection of these rates is required to estimate the effort needed to develop ...
HyunChul Joh, Yashwant K. Malaiya
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
14 years 9 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa