85 search results - page 2 / 17 » Landmark-Based Routing in Dynamic Graphs |
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
ICCV
2007
IEEE
13 years 7 months ago
2007
IEEE
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
DIALM
2005
ACM
13 years 7 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
ESA
2009
Springer
13 years 12 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...