1261 search results - page 68 / 253 » Approximation algorithms for aligning points |
JAT
2010
14 years 8 months ago
2010
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
DCG
2008
14 years 9 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
101
click to vote
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
ALGORITHMICA
2010
14 years 10 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
MICCAI
1999
Springer
15 years 2 months ago
1999
Springer
Interpolation is required in many medical image processing operations. From sampling theory, it follows that the ideal interpolation kernel is the sinc function, which is of infin...