2084 search results - page 88 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
121
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
100
click to vote
STACS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
150
Voted
OPODIS
2010
15 years 10 days ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
131
Voted
UAI
2004
15 years 3 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...