Sciweavers

2 search results - page 1 / 1
» Approximate Shortest Distance Computing: A Query-Dependent L...
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 10 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
MOBIHOC
2005
ACM
14 years 9 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang