Sciweavers

63 search results - page 5 / 13
» Efficient Computation of Roots in Finite Fields
Sort
View
ISBI
2008
IEEE
14 years 8 months ago
Robust image registration based on a Partition of Unity Finite Element Method
In this paper, we present a robust, hierarchical Partition of Unity Finite Element Method (PUFEM) to compute the transformation between two images, which is represented by a non-r...
Laurent D. Cohen, Oudom Somphone, Shérif Ma...
CVPR
2007
IEEE
14 years 9 months ago
An Efficient Minimal Solution for Infinitesimal Camera Motion
Given five motion vectors observed in a calibrated camera, what is the rotational and translational velocity of the camera? This problem is the infinitesimal motion analogue to th...
Chris Engels, David Nistér, Henrik Stew&eac...
ECCV
2006
Springer
14 years 9 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
CMA
2010
183views more  CMA 2010»
13 years 4 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
JOC
2010
96views more  JOC 2010»
13 years 2 months ago
On the Efficient Generation of Prime-Order Elliptic Curves
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...