95 search results - page 14 / 19 » Upper bounds on the non-3-colourability threshold of random ... |
INFOCOM
2009
IEEE
15 years 4 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...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
72
Voted
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
75
Voted
BROADNETS
2005
IEEE
15 years 3 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...