1401 search results - page 141 / 281 » Randomness in Interactive Proofs |
IJNSEC
2008
14 years 10 months ago
2008
The notion of strong designated verifier signature was put forth by Jakobsson, Sako and Impagliazzo in 1996, but the formal definition was defined recently by Saeednia, Kremer and...
IJBC
2007
14 years 10 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
TALG
2010
14 years 8 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...