1957 search results - page 269 / 392 » Approximate algorithms for neural-Bayesian approaches |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
VMV
2003
14 years 11 months ago
2003
The visual hull is an efficient shape approximation for the purpose of reconstructing and visualizing dynamic objects. Recently, rapid progress in graphics hardware development h...
CGF
2008
14 years 10 months ago
2008
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
CGF
2007
14 years 10 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
PAMI
2006
14 years 10 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...