Sciweavers

189 search results - page 17 / 38
» Shortest Paths Without a Map
Sort
View
INFOCOM
2002
IEEE
14 years 21 days ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
INFOCOM
2010
IEEE
13 years 6 months ago
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efï¬...
Fragkiskos Papadopoulos, Dmitri V. Krioukov, Mari&...
RT
2005
Springer
14 years 1 months ago
Metropolis Photon Sampling with Optional User Guidance
We present Metropolis Photon Sampling (MPS), a visual importance-driven algorithm for populating photon maps. Photon Mapping and other particle tracing algorithms fail if the phot...
Shaohua Fan, Stephen Chenney, Yu-chi Lai
ISPAN
2005
IEEE
14 years 1 months ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
CVPR
2004
IEEE
14 years 9 months ago
2D-Shape Analysis Using Conformal Mapping
The study of 2D shapes and their similarities is a central problem in the field of vision. It arises in particular from the task of classifying and recognizing objects from their ...
Eitan Sharon, David Mumford