2084 search results - page 54 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
STACS
2004
Springer
15 years 3 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
104
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
FSTTCS
1995
Springer
15 years 1 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...