1612 search results - page 51 / 323 » Analysing Randomized Distributed Algorithms |
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
FOCS
2008
IEEE
14 years 10 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
113
click to vote
TWC
2008
14 years 9 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...