174 search results - page 5 / 35 » Algorithms for center and Tverberg points |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
MIR
2006
ACM
14 years 1 months ago
2006
ACM
This paper presents a new interest points detector whose goal is to better catch visual attention than standard detectors. It is based on the generalization of Loy and Zelinsky tr...
SIAMCO
2002
13 years 7 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
ICIP
1998
IEEE
14 years 9 months ago
1998
IEEE
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It d...