Sciweavers

921 search results - page 24 / 185
» Abstract Matrix Arithmetic
Sort
View
AFRICACRYPT
2010
Springer
14 years 2 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
DATE
1999
IEEE
134views Hardware» more  DATE 1999»
13 years 12 months ago
Verifying Imprecisely Working Arithmetic Circuits
If real number calculations are implemented as circuits, only a limited preciseness can be obtained. Hence, formal verification can not be used to prove the equivalence between th...
Michaela Huhn, Klaus Schneider, Thomas Kropf, Geor...
ISCOPE
1999
Springer
13 years 11 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
MFCS
2007
Springer
14 years 1 months ago
Reachability Problems in Quaternion Matrix and Rotation Semigroups
Abstract. We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is s...
Paul Bell, Igor Potapov
TSP
2008
166views more  TSP 2008»
13 years 7 months ago
Blind Identification of Underdetermined Mixtures by Simultaneous Matrix Diagonalization
Abstract--In this paper, we study simultaneous matrix diagonalization-based techniques for the estimation of the mixing matrix in underdetermined independent component analysis (IC...
Lieven De Lathauwer, Joséphine Castaing