Sciweavers

72 search results - page 5 / 15
» A Modular Method for Computing the Splitting Field of a Poly...
Sort
View
ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
13 years 9 months ago
Computing Hilbert Class Polynomials
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
Juliana Belding, Reinier Bröker, Andreas Enge...
ASIACRYPT
2006
Springer
13 years 11 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
13 years 12 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
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...
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph