Sciweavers

7109 search results - page 239 / 1422
» Process Algebra with Combinators
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
15 years 4 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
EDBT
2012
ACM
214views Database» more  EDBT 2012»
13 years 6 months ago
An optimization framework for map-reduce queries
We present an effective optimization framework for general SQLlike map-reduce queries, which is based on a novel query algebra and uses a small number of higher-order physical ope...
Leonidas Fegaras, Chengkai Li, Upa Gupta
VLDB
2002
ACM
139views Database» more  VLDB 2002»
16 years 4 months ago
TIMBER: A native XML database
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
H. V. Jagadish, Shurug Al-Khalifa, Adriane Chapman...
JLP
2007
91views more  JLP 2007»
15 years 4 months ago
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is th...
Marco Bernardo
ENTCS
2000
97views more  ENTCS 2000»
15 years 4 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba