Sciweavers

29 search results - page 1 / 6
» Better Landmarks Within Reach
Sort
View
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
14 years 1 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
INFOCOM
2006
IEEE
14 years 1 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas
ICNP
2005
IEEE
14 years 1 months ago
Landmark Guided Forwarding
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
Menghow Lim, Adam Chesterfield, Jon Crowcroft, Jul...
ICASSP
2011
IEEE
12 years 11 months ago
Time-varying lung ventilation analysis of 4DCT using image registration
Imaging techniques for measuring lung ventilation are essential tools to study lung tissue response to radiation therapy. Most of the existing CT and image registration based vent...
Kai Ding, Kaifang Du, Kunlin Cao, Gary E. Christen...
COSIT
2001
Springer
186views GIS» more  COSIT 2001»
14 years 4 days ago
Computational Structure in Three-Valued Nearness Relations
The development of cognitively plausible models of human spatial reasoning may ultimately result in computational systems that are better equipped to meet human needs. This paper e...
Matt Duckham, Michael F. Worboys