3750 search results - page 98 / 750 » Timed Automata Patterns |
TACS
2001
Springer
15 years 2 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
GRAMMARS
2000
14 years 9 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-autom...
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Similarity search in time series data is used in diverse domains. The most prominent work has focused on similarity search considering either complete time series or certain subseq...
165
click to vote
ICDE
1999
IEEE
15 years 11 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...