Results 1  10
of
258,787
Composition Theorem for Generalized Sum
, 2001
"... Introduction Composition Theorems are tools which reduce sentences about some compound structure to sentences about its parts. A seminal example of such a result is the FefermanVaught Theorem [2] which reduces the firstorder theory of generalized products to the first order theory of its factors ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Introduction Composition Theorems are tools which reduce sentences about some compound structure to sentences about its parts. A seminal example of such a result is the FefermanVaught Theorem [2] which reduces the firstorder theory of generalized products to the first order theory of its factors
Composition theorems, multiplier . . .
"... An important chapter in the theory of distribution of zeros of polynomials and transcendental entire functions pertains to the study of linear operators acting on entire functions. This article surveys some recent developments (as well as some classical results) involving some specific classes of ..."
Abstract
 Add to MetaCart
of linear operators called multiplier sequences and complex zero decreasing sequences. This expository article consists of four parts: Open problems and background information, Composition theorems (Section 2), Multiplier sequences and the LaguerrePólya class (Section 3) and Complex zero decreasing
Differential privacy . . .
, 2009
"... We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradigm for differentially private mechanisms, which we call ProposeTestRelease (PTR), and for which we give a formal definit ..."
Composition theorems in communication complexity
, 2009
"... Abstract. A wellstudied class of functions in communication complexity are composed functions of the form (f ◦ g n)(x, y) = f(g(x 1, y 1),..., g(x n, y n)). This is a rich family of functions which encompasses many of the important examples in the literature. It is thus of great interest to unders ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
Abstract. A wellstudied class of functions in communication complexity are composed functions of the form (f ◦ g n)(x, y) = f(g(x 1, y 1),..., g(x n, y n)). This is a rich family of functions which encompasses many of the important examples in the literature. It is thus of great interest to understand what properties of f and g affect the communication complexity of (f ◦ g n), and in what way. Recently, Sherstov [She09] and independently ShiZhu [SZ09b] developed conditions on the inner function g which imply that the quantum communication complexity of f ◦g n is at least the approximate polynomial degree of f. We generalize both of these frameworks. We show that the pattern matrix framework of Sherstov works whenever the inner function g is strongly balanced—we say that g: X×Y → {−1, +1} is strongly balanced if all rows and columns in the matrix Mg = [g(x, y)]x,y sum to zero. This result strictly generalizes the pattern matrix framework of Sherstov [She09], which has been a very useful idea in a variety of settings [She08b,RS08,Cha07,LS09a,CA08,BHN09]. ShiZhu require that the inner function g has small spectral discrepancy, a somewhat awkward condition to verify. We relax this to the usual notion of discrepancy. We also enhance the framework of composed functions studied so far by considering functions F (x, y) = f(g(x, y)), where the range of g is a group G. When G is Abelian, the analogue of the strongly balanced condition becomes a simple group invariance property of g. We are able to formulate a general lower bound on F whenever g satisfies this property. 1
Composition Theorems in DIAlgebra
, 1994
"... The design and the automated synthesis and verification of asynchronous circuits are active areas of research. Delayinsensitive circuits are a very robust class of asynchronous circuits, viz. circuits that operate correctly independent of delays in components or interconnecting wires. DIalgebra is ..."
Abstract
 Add to MetaCart
of basic components: relatively small building blocks, with simple functionality, from which more complex circuits can be built. Examples of such components include Merge, Wire, Fork and Join components. The verification of a design consists of the proof that the composition of the basic components
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 746 (102 self)
 Add to MetaCart
Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more
Composition Theorems for CCA Cryptographic Security
"... Abstract. We present two new theorems to analyze the indistinguishability of the composition of cryptographic permutations and the indistinguishability of the XOR of cryptographic functions. Using the H Coefficients technique of [Pat01], for any two families of permutations F and G with CCA distingh ..."
Abstract
 Add to MetaCart
Abstract. We present two new theorems to analyze the indistinguishability of the composition of cryptographic permutations and the indistinguishability of the XOR of cryptographic functions. Using the H Coefficients technique of [Pat01], for any two families of permutations F and G with CCA
QoSaware middleware for web services composition
 IEEE TRANS. SOFTWARE ENG
, 2004
"... The paradigmatic shift from a Web of manual interactions to a Web of programmatic interactions driven by Web services is creating unprecedented opportunities for the formation of online BusinesstoBusiness (B2B) collaborations. In particular, the creation of valueadded services by composition of ..."
Abstract

Cited by 474 (6 self)
 Add to MetaCart
The paradigmatic shift from a Web of manual interactions to a Web of programmatic interactions driven by Web services is creating unprecedented opportunities for the formation of online BusinesstoBusiness (B2B) collaborations. In particular, the creation of valueadded services by composition
Security and Composition of Multiparty Cryptographic Protocols
 JOURNAL OF CRYPTOLOGY
, 1998
"... We present general definitions of security for multiparty cryptographic protocols, with focus on the task of evaluating a probabilistic function of the parties' inputs. We show that, with respect to these definitions, security is preserved under a natural composition operation. The definiti ..."
Abstract

Cited by 465 (19 self)
 Add to MetaCart
We present general definitions of security for multiparty cryptographic protocols, with focus on the task of evaluating a probabilistic function of the parties' inputs. We show that, with respect to these definitions, security is preserved under a natural composition operation
Results 1  10
of
258,787