1401 search results - page 155 / 281 » Randomness in Interactive Proofs |
PKC
2012
Springer
13 years 11 days ago
2012
Springer
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
TCC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
CVPR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper proposes a unified framework for spatiotemporal segmentation of video sequences. A Bayesian network is presented to model the interactions among the motion vector field...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
In this short note we demonstrate the applicability of hyperlink downweighting by means of language model disagreement. The method filters out hyperlinks with no relevance to the ...