233 search results - page 43 / 47 » Learning Regular Expressions from Noisy Sequences |
RECOMB
2004
Springer
14 years 11 months ago
2004
Springer
We present a novel classification-based algorithm called GeneClass for learning to predict gene regulatory response. Our approach is motivated by the hypothesis that in simple orga...
APBC
2008
14 years 10 days ago
2008
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
CCS
2003
ACM
14 years 4 months ago
2003
ACM
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
COLT
1999
Springer
14 years 3 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
SIGMOD
2011
ACM
13 years 1 months ago
2011
ACM
Information Extraction (IE) — the problem of extracting structured information from unstructured text — has become the key enabler for many enterprise applications such as sem...