5153 search results - page 401 / 1031 » Introduction to Randomized Algorithms |
151
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
138
click to vote
SPAA
1996
ACM
15 years 9 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...
163
Voted
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
235
click to vote
DC
2011
14 years 4 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
159
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...