1401 search results - page 77 / 281 » Randomness in Interactive Proofs |
COLCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an...
118
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
IJCV
2006
14 years 9 months ago
2006
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
CRYPTO
2003
Springer
15 years 3 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...