417 search results - page 51 / 84 » Fast Methods for Solving Linear Diophantine Equations |
ICCV
2001
IEEE
14 years 10 months ago
2001
IEEE
A linear method for computing a projective reconstruction from a large number of images is presented and then evaluated. The method uses planar homographies between views to linea...
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
MP
2002
13 years 8 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
SIAMSC
2010
13 years 3 months ago
2010
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
GD
2005
Springer
14 years 2 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...