Sciweavers

5334 search results - page 93 / 1067
» Communicating quantum processes
Sort
View
122
Voted
CIE
2006
Springer
15 years 7 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
ENTCS
2007
104views more  ENTCS 2007»
15 years 3 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
149
Voted
ACSW
2003
15 years 4 months ago
Security in Mobile Communications: Challenges and Opportunities
The nature of mobile communication, characterised for example by terminals having poor user interface and limited processing capacity, as well as complex combination of network pr...
Audun Jøsang, Gunnar Sanderud
146
Voted
SCP
2011
228views Communications» more  SCP 2011»
14 years 10 months ago
Dynamic consistency in process algebra: From Paradigm to ACP
The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistent...
Suzana Andova, Luuk Groenewegen, Erik P. de Vink
131
Voted
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
15 years 10 months ago
Rethinking the design of distributed stream processing systems
In this paper, we present a novel architecture to support large scale stream processing services in a widely distributed environment. The proposed system, COSMOS, distinguishes it...
Yongluan Zhou, Karl Aberer, Ali Salehi, Kian-Lee T...