Sciweavers

2087 search results - page 41 / 418
» Computation of class numbers of quadratic number fields
Sort
View
NIPS
2004
13 years 10 months ago
Exponentiated Gradient Algorithms for Large-margin Structured Classification
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes super...
Peter L. Bartlett, Michael Collins, Benjamin Taska...
LOGCOM
2007
92views more  LOGCOM 2007»
13 years 8 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
14 years 19 days ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
IPPS
2009
IEEE
14 years 3 months ago
A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
Lakhdar Loukil, Malika Mehdi, Nouredine Melab, El-...
EUROCRYPT
2011
Springer
12 years 12 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...