Sciweavers

5580 search results - page 718 / 1116
» Randomized priority algorithms
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 12 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
SPAA
2010
ACM
15 years 11 months ago
Collaborative scoring with dishonest participants
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...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
COCOON
1998
Springer
15 years 11 months ago
On The Bahncard Problem
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...
Rudolf Fleischer
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 11 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
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...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
COMPGEOM
1997
ACM
15 years 11 months ago
Cylindrical Static and Kinetic Binary Space Partitions
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...
Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Mural...