Sciweavers

2663 search results - page 457 / 533
» How to Choose a Timing Model
Sort
View
ICLP
2007
Springer
14 years 3 months ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
ICSOC
2007
Springer
14 years 3 months ago
Let It Flow: Building Mashups with Data Processing Pipelines
Mashups are a new kind of interactive Web application, built out of the composition of two or more existing Web service APIs and data sources. Whereas “pure” mashups are built ...
Biörn Biörnstad, Cesare Pautasso
LFCS
2007
Springer
14 years 3 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
PAIRING
2007
Springer
148views Cryptology» more  PAIRING 2007»
14 years 3 months ago
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
This paper puts forward new efficient constructions for public-key broadcast encryption that simultaneously enjoy the following properties: receivers are stateless; encryption is c...
Cécile Delerablée, Pascal Paillier, ...
ESCIENCE
2006
IEEE
14 years 2 months ago
Communication over a Secured Heterogeneous Grid with the GriddLeS Runtime Environment
Scientific workflows are a powerful programming technique for specifying complex computations using a number of otherwise independent components. When used in a Grid environment, ...
Jagan Kommineni, David Abramson, Jefferson Tan