Sciweavers

1840 search results - page 85 / 368
» time 2002
Sort
View
IJON
2002
103views more  IJON 2002»
15 years 6 months ago
RBF networks training using a dual extended Kalman filter
: A new supervised learning procedure for training RBF networks is proposed. It uses a pair of parallel running Kalman filters to sequentially update both the output weights and th...
Iulian B. Ciocoiu
FCCM
2002
IEEE
114views VLSI» more  FCCM 2002»
15 years 11 months ago
Implementing a Simple Continuous Speech Recognition System on an FPGA
Speech recognition is a computationally demanding task, particularly the stage which uses Viterbi decoding for converting pre-processed speech data into words or sub-word units. W...
Stephen J. Melnikoff, Steven F. Quigley, Martin J....
MOC
2002
185views more  MOC 2002»
15 years 6 months ago
Repunit R49081 is a probable prime
The Repunit R49081 = (1049081 - 1)/9 is a probable prime. In order to prove primality R49080 must be approximately 33.3% factored. The status of this factorization is included. Rep...
Harvey Dubner
MOC
2002
84views more  MOC 2002»
15 years 6 months ago
Smooth ideals in hyperelliptic function fields
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...
Andreas Enge, Andreas Stein
STOC
2002
ACM
117views Algorithms» more  STOC 2002»
16 years 6 months ago
Hardness amplification within NP
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
Ryan O'Donnell