Sciweavers

179 search results - page 3 / 36
» On Approximating the Average Distance Between Points
Sort
View

Publication
322views
13 years 10 months ago
Three-dimensional point cloud recognition via distributions of geometric distances
Ageometric framework for the recognition of three-dimensional objects represented by point clouds is introducedin this paper. The proposed approach is based on comparing distribut...
Mona Mahmoudi, Guillermo Sapiro
ICASSP
2011
IEEE
12 years 9 months ago
Convergence of a distributed parameter estimator for sensor networks with local averaging of the estimates
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...
Pascal Bianchi, Gersende Fort, Walid Hachem, J&eac...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
13 years 11 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
INFOCOM
2011
IEEE
12 years 9 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 7 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet