Sciweavers

237 search results - page 17 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
AAAI
2008
13 years 10 months ago
CRF-OPT: An Efficient High-Quality Conditional Random Field Solver
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
Minmin Chen, Yixin Chen, Michael R. Brent
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 7 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
DCC
2002
IEEE
14 years 7 months ago
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
Jorge Guajardo, Christof Paar
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 7 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
ALGORITHMICA
2000
106views more  ALGORITHMICA 2000»
13 years 7 months ago
Algorithms for Sensorless Manipulation Using a Vibrating Surface
We describe a programmable apparatus that uses a vibrating surface for sensorless, nonprehensile manipulation, where parts are systematically positioned and oriented without sensor...
Karl-Friedrich Böhringer, Vivek Bhatt, Bruce ...