Sciweavers

1401 search results - page 61 / 281
» Randomness in Interactive Proofs
Sort
View
SWAP
2008
14 years 11 months ago
Exploiting Semantic Technology in Computational Logic-based Service Contracting
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
Marco Alberti, Massimiliano Cattafi, Marco Gavanel...
JUCS
2008
182views more  JUCS 2008»
14 years 9 months ago
Modularizing Theorems for Software Product Lines: The Jbook Case Study
: A goal of software product lines is the economical assembly of programs in a family of programs. In this paper, we explore how theorems about program properties may be integrated...
Don S. Batory, Egon Börger
CVPR
2003
IEEE
15 years 3 months ago
Adaptive Pattern Discovery for Interactive Multimedia Retrieval
Relevance feedback has been an indispensable component for multimedia retrieval systems. In this paper, we present an adaptive pattern discovery method, which addresses relevance ...
Yimin Wu, Aidong Zhang
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
CORR
2010
Springer
132views Education» more  CORR 2010»
14 years 9 months ago
Acyclic Solos and Differential Interaction Nets
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that ...
Thomas Ehrhard, Olivier Laurent