Sciweavers

245 search results - page 18 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
ICDT
2003
ACM
106views Database» more  ICDT 2003»
14 years 1 months ago
Processing XML Streams with Deterministic Automata
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan ...
VIS
2007
IEEE
123views Visualization» more  VIS 2007»
14 years 9 months ago
Multifield Visualization Using Local Statistical Complexity
Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be ext...
Heike Jänicke, Alexander Wiebel, Gerik Scheuerm...
ICAI
2010
13 years 5 months ago
Using Sensor Sequences for Activity Recognition by Mining and Multi-Class Adaboost
- In this paper, we present an activity recognition system using sensor sequence information generated from many binary on-off state sensors. When many sensors are deployed the num...
Md. Kamrul Hasan, Sungyoung Lee, Young-Koo Lee
TCS
2002
13 years 7 months ago
Monadic second-order logic on tree-like structures
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
Igor Walukiewicz
ANLP
1997
106views more  ANLP 1997»
13 years 9 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod