119 search results - page 13 / 24 » On finite alphabets and infinite bases |
62
Voted
AUTOMATICA
2008
14 years 9 months ago
2008
In this paper, the identification of a class of nonlinear systems which admits input-output maps described by a finite degree Volterra series is considered. In actual fact, it app...
IFIP
2009
Springer
14 years 7 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
FUIN
2008
14 years 9 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
TCS
2008
14 years 9 months ago
2008
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
183
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...