Sciweavers

177 search results - page 27 / 36
» Link Distance and Shortest Path Problems in the Plane
Sort
View
MMNS
2004
167views Multimedia» more  MMNS 2004»
13 years 10 months ago
Bandwidth Constrained IP Multicast Traffic Engineering Without MPLS Overlay
Existing multicast traffic engineering (TE) solutions tend to use explicit routing through MPLS tunnels. In this paper we shift away from this overlay approach and address the band...
Ning Wang, George Pavlou
COMPGEOM
2007
ACM
14 years 17 days ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
FOCS
1993
IEEE
14 years 23 days ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
13 years 10 days ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
CN
2010
88views more  CN 2010»
13 years 8 months ago
Two-link failure protection in WDM mesh networks with p-cycles
In WDM networks, it is important to protect connections against link failures due to the high bandwidth provided by a fiber link. Although many p-cycle based schemes have been pro...
Taiming Feng, Long Long, Ahmed E. Kamal, Lu Ruan