• No results found

[PDF] Top 20 Algorithm 898 : efficient multiplication of dense matrices over GF(2)

Has 10000 "Algorithm 898 : efficient multiplication of dense matrices over GF(2)" found on our website. Below are the top 20 most common "Algorithm 898 : efficient multiplication of dense matrices over GF(2)".

Algorithm 898 : efficient multiplication of dense matrices over GF(2)

Algorithm 898 : efficient multiplication of dense matrices over GF(2)

... case is when m, n, ` are 64 times powers of 2 to avoid cutting within words. To deal with odd-dimensional matrices two strategies are known in the literature [Huss- Lederman et al. 1996]: One can either increase ... See full document

15

Chain Multiplication of Dense Matrices: Proposing a Shared Memory based Parallel Algorithm

Chain Multiplication of Dense Matrices: Proposing a Shared Memory based Parallel Algorithm

... the multiplication of given matrix ...of matrices is considered in sequences and less number of ...thousand matrices of larger ...the matrices are dense and contains floating point ... See full document

6

Multiplication of medium-density matrices using TensorFlow on multicore CPUs

Multiplication of medium-density matrices using TensorFlow on multicore CPUs

... Matrix multiplication is a basis for computation in many areas, such as linear algebra, machine learning and image ...matrix multiplication are studied in different environments. For dense ... See full document

5

An Efficient Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats

An Efficient Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats

... The key advantage of the BCSR format (and blocked formats in general) is the reduced com- plexity of operations on the “dense” part of the matrices. For example, consider the common operation of a ... See full document

21

A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm

A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm

... Figure 4 shows the performance of four shared-memory SpMSpV algorithms on eleven real world matrices from Table IV on a single node of Edison. To ensure the fairness in comparing algorithms, the same source vertex ... See full document

11

Commutative Law for the Multiplication of Matrices as Viewed in Terms of Hankel's Principle

Commutative Law for the Multiplication of Matrices as Viewed in Terms of Hankel's Principle

... as matrices and explain that λ k is just taken from left to right in actually operating with the commutativity as it is a ...right multiplication of a column vector u k with a scalar λ k , u k λ k , implies ... See full document

7

Quantum  algorithm  for  the  discrete  logarithm  problem  for  matrices  over  finite  group  rings

Quantum algorithm for the discrete logarithm problem for matrices over finite group rings

... • Code-based cryptography that relies on error-correcting codes, such as McEliece encryption ([7]) and Niederreiter signatures ([13]). For a recent survey of quantum-resistant public-key schemes see [16]. There are also ... See full document

8

Space  and time efficient algorithm for maintaining dense subgraphs on one pass dynamic streams

Space and time efficient algorithm for maintaining dense subgraphs on one pass dynamic streams

... fying dense communities in social networks ...an algorithm that is more popu- lar in practice is an O(m)-time O(m)-space 2-approximation algorithm of Charikar ...This algorithm is not suitable ... See full document

11

On Matrices Over Semirings

On Matrices Over Semirings

... paper, matrices over semirings are ...of matrices over semirings as generalization of corresponding results on matrices over ... See full document

10

EFFICIENT MATRIX MULTIPLICATION IN HADOOP

EFFICIENT MATRIX MULTIPLICATION IN HADOOP

... apparent in Figure 3(a) because of the small size of the cluster. In Figures 3(b) and (c), we have minimized the running time when n is either 4 or 6. Another aspect that we should notice is the amount of input traffic ... See full document

12

Implementing  Joux-Vitse's  Crossbred  Algorithm  for  Solving  MQ  Systems  over  GF(2)  on  GPUs

Implementing Joux-Vitse's Crossbred Algorithm for Solving MQ Systems over GF(2) on GPUs

... from external hybridization evenly over the nodes. The results are given in Ta- ble 3, which basically has the same format and notation as Table 2. In these larger experiments, sub-systems were extracted from ... See full document

20

MEA: an energy efficient algorithm for dense sector based wireless sensor networks

MEA: an energy efficient algorithm for dense sector based wireless sensor networks

... energy-efficient algorithm using the power control ...The algorithm presented in this study, which was based on a power control scheme, minimizes the energy consumption when the same width was used ... See full document

13

A*-Algebras over Matrices

A*-Algebras over Matrices

... A*-algebras over the matrices. We give the definition of A*-matrices, example, Proves the theorem the set of mn matrices forms an A*-algebra, Boolean algebras over the matrices ... See full document

16

Implementation of Generic and Efficient Architecture of Elliptic Curve Cryptography over Various GF(p) for Higher Data Security

Implementation of Generic and Efficient Architecture of Elliptic Curve Cryptography over Various GF(p) for Higher Data Security

... limitation, hardware implementation becomes a more suitable option [5]. Recently all the designs mostly vary in the underlying finite field (GF(2 m ) and GF(p)). The software and hardware co-approach ... See full document

7

Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices

Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices

... Overview of the algorithm. To speed up FD, we will use the idea of adaptive random sampling. Let us first review the standard FD algorithm. Given an integer parameter ` ≤ d, the algorithm always ... See full document

23

Solvability of Inverse Eigenvalue Problem for Dense Singular Symmetric Matrices

Solvability of Inverse Eigenvalue Problem for Dense Singular Symmetric Matrices

... The inverse eigenvalue problem (IEP) involves the re- construction of a matrix from prescribed spectral data. In order to limit the number of usually infinitely many solu- tions that are usually possible, if a solution ... See full document

6

On Matrices Over Path Algebra

On Matrices Over Path Algebra

... of matrices over path ...and matrices over semirings. Transitive matrices are important type of ...of matrices over a general path ... See full document

11

An Efficient Algorithm for Frequent Pattern Mining for Real-Time Business Intelligence Analytics in Dense Datasets

An Efficient Algorithm for Frequent Pattern Mining for Real-Time Business Intelligence Analytics in Dense Datasets

... force algorithm BDFS(b)-diff-sets, which is a variant of the Block Depth First Search [7] and inducted into the domain of frequent pattern mining [5, ...search algorithm, based on a novel combination of the ... See full document

16

Efficient Multiplication Architectures for Truncated Polynomial Ring

Efficient Multiplication Architectures for Truncated Polynomial Ring

... Cloud computing utilizes three delivery models by which different types of services are delivered to end users. The three delivery models are Software as a Service (SaaS), Infrastructure as a Service (IaaS) and Platform ... See full document

96

On Invertibility of Matrices over Semirings

On Invertibility of Matrices over Semirings

... of matrices over general semirings has a long ...of matrices over semirings were published [1, ...and matrices over semirings in his work [5] ...of matrices have important ... See full document

9

Show all 10000 documents...