5153 search results - page 485 / 1031 » Introduction to Randomized Algorithms |
149
click to vote
COCO
1994
Springer
15 years 10 months ago
1994
Springer
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...
139
Voted
FUN
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of mi...
166
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
147
Voted
ESA
2006
Springer
15 years 10 months ago
2006
Springer
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
175
click to vote
NIPS
2007
15 years 7 months ago
2007
We describe a new algorithm, Relaxed Survey Propagation (RSP), for finding MAP configurations in Markov random fields. We compare its performance with state-of-the-art algorith...