Sciweavers

2489 search results - page 265 / 498
» On the Subgroup Distance Problem
Sort
View
BROADNETS
2007
IEEE
16 years 1 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun
VTC
2007
IEEE
190views Communications» more  VTC 2007»
16 years 1 months ago
An Adaptive Location Estimator Based on Kalman Filtering for Wireless Sensor Networks
—In this paper, we present a positioning and tracking scheme based on adaptive weighted interpolation and Kalman filtering for wireless sensor networks. The proposed positioning ...
Chin-Liang Wang, Yih-Shyh Chiou, Yu-Sheng Dai
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
16 years 1 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
16 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....
3DPVT
2006
IEEE
185views Visualization» more  3DPVT 2006»
16 years 1 months ago
A Probabilistic Method for Aligning and Merging Range Images with Anisotropic Error Distribution
This paper describes a probabilistic method of aligning and merging range images. We formulate these issues as problems of estimating the maximum likelihood. By examining the erro...
Ryusuke Sagawa, Nanaho Osawa, Yasushi Yagi