196 search results - page 20 / 40 » On Risky Methods for Local Selection under Noise |
177
click to vote
INFOCOM
2007
IEEE
16 years 11 days ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
153
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
182
click to vote
CGO
2010
IEEE
16 years 29 days ago
2010
IEEE
Tiling is a widely used loop transformation for exposing/exploiting parallelism and data locality. Effective use of tiling requires selection and tuning of the tile sizes. This is...
162
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
164
click to vote
TOG
2008
15 years 6 months ago
2008
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...