Sciweavers

471 search results - page 30 / 95
» Faster Multiplication in GF(2)[x]
Sort
View
ATS
2003
IEEE
105views Hardware» more  ATS 2003»
14 years 3 months ago
Minimizing Defective Part Level Using a Linear Programming-Based Optimal Test Selection Method
Recent probabilistic test generation approaches have proven that detecting single stuck-at faults multiple times is effective at reducing the defective part level (DPL). Unfortuna...
Yuxin Tian, Michael R. Grimaila, Weiping Shi, M. R...
CRYPTO
2000
Springer
91views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
An Improved Pseudo-random Generator Based on Discrete Log
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
Rosario Gennaro
ICDAR
1999
IEEE
14 years 2 months ago
Combining Classifiers based on Confidence Values
This paper describes our investigation into the neural gas (NG) network algorithm and the hierarchical overlapped architecture (HONG) which we have built by retaining the essence ...
Ajantha S. Atukorale, Ponnuthurai N. Suganthan
CGF
1999
81views more  CGF 1999»
13 years 9 months ago
Multi-layered impostors for accelerated rendering
This paper describes the successful combination of pre-generated and dynamically updated image-based representations to accelerate the visualization of complex virtual environment...
Xavier Décoret, François X. Sillion,...
MOC
1998
107views more  MOC 1998»
13 years 9 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche