2252 search results - page 330 / 451 » Lower Bounds for Dynamic Algorithms |
122
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
131
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
131
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
131
click to vote
SAT
2004
Springer
15 years 8 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
141
click to vote
VIS
2004
IEEE
16 years 4 months ago
2004
IEEE
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...