Sciweavers

6365 search results - page 202 / 1273
» Fast Local Computation Algorithms
Sort
View
GD
2006
Springer
15 years 10 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
INFOSCALE
2007
ACM
15 years 7 months ago
Scalable problem localization for distributed systems: principles and practices
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
Rui Zhang, Bruno C. d. S. Oliveira, Alan Bivens, S...
173
Voted
IPMI
2005
Springer
15 years 11 months ago
Diffeomorphic Nonlinear Transformations: A Local Parametric Approach for Image Registration
Many types of transformations are used to model deformations in medical image registration. While some focus on modeling local changes, some on continuity and invertibility, there ...
Ramkrishnan Narayanan, Jeffrey A. Fessler, Hyunjin...
CN
2006
85views more  CN 2006»
15 years 6 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
15 years 11 months ago
Performance Evaluation of Hop-by-Hop Local Mobility Agents Probing for Mobile IPv6
Mobile IPv6 (MIPv6) and Fast Handover (FHO) have been developed by the Internet Engineering Task Force (IETF) to address the IP mobility issues of roaming mobile devices, and to r...
Vrizlynn L. L. Thing, Henry C. J. Lee, Yi Xu