Sciweavers

942 search results - page 51 / 189
» Process Algebraic Non-product-forms
Sort
View
ENTCS
2006
141views more  ENTCS 2006»
14 years 9 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...
ICDT
2007
ACM
143views Database» more  ICDT 2007»
15 years 3 months ago
Database Query Processing Using Finite Cursor Machines
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 1 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
15 years 11 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...
WSC
2000
14 years 11 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis