Sciweavers

10 search results - page 1 / 2
» Geometric Exploration of the Landmark Selection Problem
Sort
View
PAM
2004
Springer
13 years 10 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
ICRA
1993
IEEE
131views Robotics» more  ICRA 1993»
13 years 9 months ago
Exploration Strategies for Mobile Robots
The problem of programming a robot t o carry out a systematic exploration of its environment using realistic sensors is considered in this paper. The robot is modelled as a single...
Camillo J. Taylor, David J. Kriegman
CIKM
2009
Springer
13 years 11 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ICDCS
2006
IEEE
13 years 11 months ago
A Hierarchical Approach to Internet Distance Prediction
Internet distance prediction gives pair-wise latency information with limited measurements. Recent studies have revealed that the quality of existing prediction mechanisms from th...
Rongmei Zhang, Y. Charlie Hu, Xiaojun Lin, Sonia F...
ICVS
1999
Springer
13 years 9 months ago
3-D Modelling and Robot Localization from Visual and Range Data in Natural Scenes
Abstract. This paper concerns the exploration of a natural environment by a mobile robot equipped with both a video camera and a range sensor (stereo or laser range finder); we fo...
Carlos Parra, Rafael Murrieta-Cid, Michel Devy, Ma...