Results 21 to 30 of about 1,720,417 (290)
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]
, 2009 We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej, +4 more
core +1 more source
Compressed matrix multiplication [PDF]
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012 We present a simple algorithm that approximates the product of n -by- n real matrices A and B . Let ‖AB‖ F denote the Frobenius norm of AB , and b
openaire +3 more sources
Algorithm 898 : efficient multiplication of dense matrices over GF(2) [PDF]
, 2010 We describe an efficient implementation of a hierarchy of algorithms for multiplication of dense matrices over the field with two elements (F-2). In particular we present our implementation in the M4RI library-of Strassen-Winograd matrix multiplication ...
Albrecht, Martin +5 more
core +1 more source
Applied Sciences, 2023 Intelligence development has put forward increasing requirements of real-time planning and dynamic feedback in controlling robotic arms. It has become essential in engineering applications to complete the kinematics calculation of complex manipulators in
Jiyang Yu +4 more
doaj +1 more source
Hierarchical Coded Matrix Multiplication [PDF]
IEEE Transactions on Information Theory, 2019 In distributed computing systems slow working nodes, known as stragglers, can greatly extend finishing times. Coded computing is a technique that enables straggler-resistant computation. Most coded computing techniques presented to date provide robustness by ensuring that the time to finish depends only on a set of the fastest nodes.
Shahrzad Kiani +2 more
openaire +6 more sources
Parallel Transitive Closure Algorithm for Heterogeneous Architecture [PDF]
Jisuanji gongcheng, 2021 The traditional method for obtaining the transitive closure of the graphs faces the large amount of calculation and long calculation time. In order to improve the computing speed of the transitive closure algorithm for dealing with large amounts of data,
XIAO Han, GUO Baoyun, LI Cailin, ZHOU Qinglei
doaj +1 more source
DistME: A Fast and Elastic Distributed Matrix Computation Engine using GPUs
, 2022 Matrix computation, in particular, matrix multiplication is time-consuming, but essentially and widely used in a large number of applications in science and industry.
남윤민 +5 more
core +1 more source
Fast Sparse Matrix Multiplication [PDF]
ACM Transactions on Algorithms, 2004 Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m nonzero elements. We present a new algorithm that multiplies A and
Raphael Yuster, Uri Zwick
openaire +3 more sources
Coded Matrix Multiplication [PDF]
, 2022 Matrix multiplication is a fundamental building block in many machine learning models. As the input matrices may be too large to be multiplied on a single server, it is common to split input matrices into multiple sub-matrices and execute the ...
Fan, Xiaodi
core +1 more source
Optimisation of constant matrix multiplication operation hardware using a genetic algorithm [PDF]
, 2006 The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems.
O'Connor, Noel E. +6 more
core +2 more sources