5153 search results - page 634 / 1031 » Introduction to Randomized Algorithms |
131
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
120
click to vote
COCOON
1998
Springer
15 years 9 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
144
click to vote
STOC
1998
ACM
15 years 9 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...
132
click to vote
COMPGEOM
1997
ACM
15 years 9 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
144
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...