376 search results - page 53 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
153
click to vote
ALGORITHMICA
2004
15 years 5 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. ...
163
click to vote
IH
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
175
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
284
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
178
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...