Sciweavers

516 search results - page 21 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Smoothing fir filtering of discrete state-space polynomial signal models
A smoothing finite impulse response (FIR) filter is addressed for discrete time-invariant state-space polynomial models commonly used to model signals over finite data. A gener...
Oscar Gerardo Ibarra-Manzano, Yuriy S. Shmaliy, Lu...
AMC
1999
128views more  AMC 1999»
13 years 9 months ago
An elementary result in the stability theory of time-invariant nonlinear discrete dynamical systems
The stability of the equilibria of time-invariant nonlinear dynamical systems with discrete time scale is investigated. We present an elementary proof showing that in the case of ...
Weiye Li, Ferenc Szidarovszky
DAM
2006
100views more  DAM 2006»
13 years 10 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Lorenzo Traldi
JUCS
2010
161views more  JUCS 2010»
13 years 8 months ago
Evaluating Linear XPath Expressions by Pattern-Matching Automata
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 4 months ago
General Iteration graphs and Boolean automata circuits
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
Mathilde Noual