417 search results - page 72 / 84 » Fast Methods for Solving Linear Diophantine Equations |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Detecting nonrigid surfaces is an interesting research problem for computer vision and image analysis. One important challenge of nonrigid surface detection is how to register a n...
ECCV
1998
Springer
14 years 10 months ago
1998
Springer
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...
TOMS
2011
13 years 3 months ago
2011
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
CGF
2010
13 years 6 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
WINE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...