Sciweavers

124 search results - page 6 / 25
» Calculating cyclotomic polynomials
Sort
View
ASAP
1995
IEEE
145views Hardware» more  ASAP 1995»
13 years 11 months ago
An array processor for inner product computations using a Fermat number ALU
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, Wil...
ARITH
2007
IEEE
13 years 11 months ago
An Algorithm for Inversion in GF(2^m) Suitable for Implementation Using a Polynomial Multiply Instruction on GF(2)
An algorithm for inversion in GF(2m ) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid's algorithm...
Katsuki Kobayashi, Naofumi Takagi, Kazuyoshi Takag...
ICPR
2008
IEEE
14 years 2 months ago
Learning polynomial function based neutral-emotion GMM transformation for emotional speaker recognition
One of the biggest challenges in speaker recognition is dealing with speaker-emotion variability. The basic problem is how to train the emotion GMMs of the speakers from their neu...
Zhenyu Shan, Yingchun Yang
MOC
2000
75views more  MOC 2000»
13 years 7 months ago
Some polynomials over Q(t) and their Galois groups
Abstract. Examples of polynomials with Galois group over Q(t) corresponding to every transitive group through degree eight are calculated, constructively demonstrating the existenc...
Gene Ward Smith
JGO
2008
90views more  JGO 2008»
13 years 7 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier