6393 search results - page 901 / 1279 » Randomized Algorithms on the Mesh |
156
click to vote
IM
2007
15 years 6 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
159
click to vote
JCO
2010
15 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
135
click to vote
JDA
2010
15 years 4 months ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
152
click to vote
PVLDB
2010
15 years 4 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
150
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...