Sciweavers

3038 search results - page 148 / 608
» High-Speed Function Approximation
Sort
View
ISBI
2004
IEEE
16 years 7 months ago
Multi-Modal Non-Rigid Registration Using a Stochastic Gradient Approximation
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
Aloys du Bois d'Aische, Benoît Macq, Florian...
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 7 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
ICRA
2006
IEEE
95views Robotics» more  ICRA 2006»
16 years 1 months ago
Discrete Approximations to Continuous Curves
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
Sean B. Andersson
ICPR
2000
IEEE
15 years 11 months ago
Two-Stage Computational Cost Reduction Algorithm Based on Mahalanobis Distance Approximations
For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computation...
Fang Sun, Shinichiro Omachi, Nei Kato, Hirotomo As...
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 8 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson