178 search results - page 29 / 36 » Boolean Algebras in Visser Algebras |
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
100
click to vote
SACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various attack models such as distinguishing attac...
VLDB
1992
ACM
15 years 1 months ago
1992
ACM
We propose an extended relational database model which can model both uncertainty and imprecision in data. This model is basedon Dempster-Shafertheory which has become popular in ...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
IJCAI
2003
14 years 11 months ago
2003
Formalisms and axiomatic theories are designed to support reasoning, they are often intended with a preferred interpretation and a targeted ontology. Questions of proper interpret...