Sciweavers

1261 search results - page 54 / 253
» Approximation algorithms for aligning points
Sort
View
BMVC
2010
14 years 7 months ago
Stratified Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by finding a reference shape and global rigid transformations given p...
Adrien Bartoli, Daniel Pizarro, Marco Loog
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ICCV
1998
IEEE
15 years 11 months ago
Robust Multi-Sensor Image Alignment
This paper presents a method for alignment of images acquired by sensors of di erent modalities (e.g., EO and IR). The paper has two main contributions: (i) It identi es an approp...
Michal Irani, P. Anandan
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 7 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu