1806 search results - page 317 / 362 » Randomness and halting probabilities |
100
click to vote
WWW
2005
ACM
16 years 15 days ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
WWW
2002
ACM
16 years 15 days ago
2002
ACM
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
PODC
2009
ACM
16 years 11 days ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
108
click to vote
TCC
2009
Springer
16 years 11 days ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
200
click to vote
POPL
2007
ACM
16 years 4 days ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...