Sciweavers

2188 search results - page 133 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
COMPGEOM
2006
ACM
15 years 8 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
141
Voted
SIGGRAPH
1993
ACM
15 years 6 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
151
Voted
3DIM
2007
IEEE
15 years 9 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
129
Voted
JMM2
2006
212views more  JMM2 2006»
15 years 2 months ago
K-means Tracker: A General Algorithm for Tracking People
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...
Chunsheng Hua, Haiyuan Wu, Qian Chen, Toshikazu Wa...
162
Voted
NIPS
2001
15 years 4 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio