339 search results - page 41 / 68 » Random Sampling Techniques in Parallel Computation |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
91
Voted
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
134
click to vote
GREC
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we present a method to robustly detect circular arcs in a line drawing image. The method is fast, robust and very reliable, and is capable of assessing the quality of...
ISCC
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....