69 search results - page 2 / 14 » Solving Linear Diophantine Equations Using the Geometric Str... |
IMA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
SIAMREV
2010
12 years 11 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
SIAMNUM
2010
12 years 11 months ago
2010
In this paper, we study the superconvergence property for the discontinuous Galerkin (DG) and the local discontinuous Galerkin (LDG) methods, for solving one-dimensional time depe...
CVPR
2000
IEEE
14 years 7 months ago
2000
IEEE
In this paper we show that given two homography matrices for two planes in space, there is a linear algorithm for the rotation and translation between the two cameras, the focal l...
JCC
2006
13 years 5 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...