163 search results - page 3 / 33 » Composition Theorems in Communication Complexity |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
In this paper we describe an approach for the verification of Web service compositions defined by sets of BPEL processes. The key aspect of such a verification is the model adopte...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— The paper deals with the problem of the carrier frequency-offset (CFO) estimation for wireless communications. Since the well-known maximum-likelihood (ML) CFO estimator is rat...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— The dynamic composition of systems of networked appliances, or virtual devices, in MANETs, enables users to generate, on-the-fly, complex strong specific systems. Current work ...
TELSYS
2002
13 years 7 months ago
2002
Formal description techniques, verification methods, and their tool-based automated application meanwhile provide valuable support for the formal analysis of communication protocol...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...