Sciweavers

1763 search results - page 109 / 353
» A Formalization of Polytime Functions
Sort
View
PROCEDIA
2010
127views more  PROCEDIA 2010»
14 years 4 months ago
Web service selection for transactional composition
In this work we address the issue of selecting and composing Web Services (WSs) considering functional requirements and transactional properties. We formalize the WS composition p...
Yudith Cardinale, Joyce El Haddad, Maude Manouvrie...
TIT
2010
107views Education» more  TIT 2010»
14 years 4 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
CAV
2009
Springer
132views Hardware» more  CAV 2009»
15 years 10 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas
ICWS
2009
IEEE
15 years 7 months ago
Composing Services for Third-party Service Delivery
This paper proposes a model-based technique for lowering the entrance barrier for service providers to register services with a marketplace broker, such that the service is rapidl...
Ingo Weber, Alistair Barros, Norman May, Jörg...
HASKELL
2009
ACM
15 years 4 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones