592 search results - page 93 / 119 » Crossing numbers of random graphs |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
ICALP
2001
Springer
14 years 12 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...