Sciweavers

7 search results - page 2 / 2
» Computational Euclid
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 6 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
CVPR
1999
IEEE
13 years 10 months ago
Shape Reconstruction in Projective Grid Space from Large Number of Images
This paper proposes a new scheme for multi-image projective reconstruction based on a projective grid space. The projective grid space is defined by two basis views and the fundam...
Hideo Saito, Takeo Kanade