Sciweavers

500 search results - page 37 / 100
» Streaming tree automata
Sort
View
FOSSACS
2001
Springer
14 years 4 days ago
On the Modularity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
Irène Durand, Aart Middeldorp
TIT
2008
106views more  TIT 2008»
13 years 7 months ago
Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
François Arnault, Thierry P. Berger, Marine...
ESOP
2009
Springer
13 years 11 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
ICDE
2006
IEEE
181views Database» more  ICDE 2006»
14 years 9 months ago
Adaptive Reorganization of Coherency-Preserving Dissemination Tree for Streaming Data
In many recent applications, data are continuously being disseminated from a source to a set of servers. In this paper, we propose a cost-based approach to construct dissemination...
Yongluan Zhou, Beng Chin Ooi, Kian-Lee Tan, Feng Y...
ACML
2009
Springer
14 years 9 days ago
Improving Adaptive Bagging Methods for Evolving Data Streams
We propose two new improvements for bagging methods on evolving data streams. Recently, two new variants of Bagging were proposed: ADWIN Bagging and Adaptive-Size Hoeffding Tree (...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...