Sciweavers

233 search results - page 2 / 47
» Learning Regular Expressions from Noisy Sequences
Sort
View
103
Voted
CORR
2008
Springer
114views Education» more  CORR 2008»
14 years 9 months ago
Temporal Support of Regular Expressions in Sequential Pattern Mining
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
PAMI
1998
87views more  PAMI 1998»
14 years 9 months ago
Learning Local Languages and Their Application to DNA Sequence Analysis
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
Takashi Yokomori, Satoshi Kobayashi
CSR
2006
Springer
15 years 1 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
ICMCS
2006
IEEE
125views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Label Disambiguation and Sequence Modeling for Identifying Human Activities from Wearable Physiological Sensors
Wearable physiological sensors can provide a faithful record of a patient’s physiological states without constant attention of caregivers. A computer program that can infer huma...
Wei-Hao Lin, Alexander G. Hauptmann
147
Voted
WIA
2009
Springer
15 years 4 months ago
Implementation of State Elimination Using Heuristics
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
Jae-Hee Ahn, Yo-Sub Han