Sciweavers

80 search results - page 7 / 16
» Efficient Multivariate Factorization over Finite Fields
Sort
View
CSDA
2010
157views more  CSDA 2010»
13 years 7 months ago
Robust estimation of constrained covariance matrices for confirmatory factor analysis
Confirmatory factor analysis (CFA) is a data anylsis procedure that is widely used in social and behavioral sciences in general and other applied sciences that deal with large qua...
E. Dupuis Lozeron, M. P. Victoria-Feser
MOC
2000
77views more  MOC 2000»
13 years 7 months ago
Isomorphisms between Artin-Schreier towers
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...
Jean Marc Couveignes
TC
2008
13 years 7 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
PRESENCE
2006
104views more  PRESENCE 2006»
13 years 7 months ago
Physically Realistic Virtual Surgery Using the Point-Associated Finite Field (PAFF) Approach
The generation of multimodal virtual environments for surgical training is complicated by the necessity to develop heterogeneous simulation scenarios such as surgical incision, ca...
Suvranu De, Yi-Je Lim, Manivannan Muniyandi, Manda...
CIS
2006
Springer
13 years 11 months ago
A New Parallel Multiplier for Type II Optimal Normal Basis
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
Chang Han Kim, Yongtae Kim, Sung Yeon Ji, IlWhan P...