2084 search results - page 136 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
141
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
146
click to vote
TECS
2010
15 years 3 months ago
2010
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
170
click to vote
SLS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
150
click to vote
WSC
2007
15 years 7 months ago
2007
It is well known that trivariate reduction — a method to generate two dependent random variables from three independent random variables — can be used to generate Poisson rand...
127
Voted
AIRWEB
2005
Springer
15 years 10 months ago
2005
Springer
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...