Sciweavers

410 search results - page 17 / 82
» Upgrading Shortest Paths in Networks
Sort
View
PAMI
2010
222views more  PAMI 2010»
14 years 12 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 1 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
CN
2007
104views more  CN 2007»
15 years 1 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem
ICCSA
2004
Springer
15 years 6 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
LCN
2006
IEEE
15 years 7 months ago
An Interior Path Vector Routing Protocol
Today’s intra-domain protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path vectors. Taking adva...
Conor Creagh, Cormac J. Sreenan