Sciweavers

1015 search results - page 21 / 203
» An efficient algorithm for AS path inferring
Sort
View
TKDE
2002
239views more  TKDE 2002»
13 years 7 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
IFIP
2004
Springer
14 years 1 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
MICCAI
2003
Springer
14 years 8 months ago
Minimum Cost Path Algorithm for Coronary Artery Central Axis Tracking in CT Images
The quality of cardiac images acquired with multi-detector CT scanners has improved significantly, to the point where minimally invasive examination of the coronary arteries became...
Marcel Breeuwer, Sílvia Delgado Olabarriaga...
RSA
2010
98views more  RSA 2010»
13 years 6 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
MICRO
2010
IEEE
149views Hardware» more  MICRO 2010»
13 years 5 months ago
Improving SIMT Efficiency of Global Rendering Algorithms with Architectural Support for Dynamic Micro-Kernels
Wide Single Instruction, Multiple Thread (SIMT) architectures often require a static allocation of thread groups that are executed in lockstep throughout the entire application ker...
Michael Steffen, Joseph Zambreno