4353 search results - page 115 / 871 » Expressiveness of Process Algebras |
153
Voted
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
One of the most powerful features of SQL is the use of nested queries. Most research work on the optimization of nested queries focuses on aggregate subqueries. However, the solut...
128
click to vote
COORDINATION
2009
Springer
16 years 4 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
124
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
112
Voted
EDBTW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
127
click to vote
UAI
2004
15 years 5 months ago
2004
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...