2188 search results - page 56 / 438 » Instance-Optimal Geometric Algorithms |
FLAIRS
2004
13 years 10 months ago
2004
A blind classification algorithm is presented that uses hyperdimensional geometric algorithms to locate a hypothesis, in the form of a convex polytope or hyper-sphere. The convex ...
IJCV
2006
13 years 8 months ago
2006
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
ISCSCT
2008
IEEE
14 years 3 months ago
2008
IEEE
—To rapidly and accurately search the corresponding points along scan-lines, rectification of stereo pairs are performed so that corresponding epipolar lines are parallel to the ...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
JCDCG
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...