Sciweavers

1246 search results - page 108 / 250
» Recursive Timed Automata
Sort
View
WSOM
2009
Springer
16 years 1 months ago
Incremental Unsupervised Time Series Analysis Using Merge Growing Neural Gas
We propose Merge Growing Neural Gas (MGNG) as a novel unsupervised growing neural network for time series analysis. MGNG combines the state-of-the-art recursive temporal context of...
Andreas Andreakis, Nicolai von Hoyningen-Huene, Mi...
POPL
2006
ACM
16 years 7 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
ICFP
2002
ACM
16 years 6 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
FOCS
1998
IEEE
15 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 6 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford