Sciweavers

35 search results - page 2 / 7
» On shortest paths in line arrangements
Sort
View
ITIIS
2010
115views more  ITIIS 2010»
13 years 5 days ago
A Border Line-Based Pruning Scheme for Shortest Path Computations
Jin-Kyu Park, Daejin Moon, Eenjun Hwang
INFOCOM
2007
IEEE
13 years 11 months ago
Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
Sungoh Kwon, Ness B. Shroff
IJCV
2002
156views more  IJCV 2002»
13 years 5 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
HIPC
2007
Springer
13 years 11 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan
INFOCOM
2006
IEEE
13 years 11 months ago
Locating Sensors in Concave Areas
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
Chen Wang, Li Xiao