120 search results - page 23 / 24 » Randomized Lower Bounds for Online Path Coloring |
149
click to vote
WEA
2010
Springer
15 years 9 months ago
2010
Springer
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...
121
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
122
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
123
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
166
click to vote
CCS
2006
ACM
15 years 7 months ago
2006
ACM
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...