995 search results - page 79 / 199 » String Pattern Discovery |
EMNLP
2006
13 years 9 months ago
2006
This paper demonstrates how unsupervised techniques can be used to learn models of deep linguistic structure. Determining the semantic roles of a verb's dependents is an impo...
PVLDB
2010
13 years 6 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
CPM
2011
Springer
12 years 11 months ago
2011
Springer
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
CSB
2004
IEEE
13 years 11 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Accelerating multi-pattern matching is a critical issue in building high-performance deep packet inspection systems. Achieving high-throughputs while reducing both memor...