Results 31 to 40 of about 1,575,789 (284)
Fast commutative matrix algorithms
Journal of Symbolic Computation, 2023 We show that the product of an nx3 matrix and a 3x3 matrix over a commutative ring can be computed using 6n+3 multiplications. For two 3x3 matrices this gives us an algorithm using 21 multiplications. This is an improvement with respect to Makarov's algorithm using 22 multiplications[13]. We generalize our result for nx3 and 3x3 matrices and present an
openaire +2 more sources
IEEE Access, 2019 Receiver operating characteristic (ROC) analysis has been widely used in two-class problems. However, in practice, three-class problems are frequently encountered, especially in the area of medicine. To evaluate the performance of three-class classifiers,
Shun Liu, Weichao Xu, Xu Sun, Yun Zhang
doaj +1 more source
, 1985 Subsumption algorithms are used in resolution oriented theorem proving to eliminate redundant clauses from the search space. In a recent paper, the authors have introduced a new subsumption algorithm DC (Division into Components) which is much more efficient than the standard algorithms. In the present paper two new results are stated.
Gottlob, G, Leitsch, A
openaire +2 more sources
Efficient Algorithm for Scattering by a Large Cluster of Moving Objects
IEEE Access, 2019 A highly efficient algorithm for analysis of electromagnetic scattering by a large cluster of independently moving objects is proposed in this paper. A double octree structure is introduced, which consists of a main octree stationary to the cluster as a ...
Hai-Li Zhang +4 more
doaj +1 more source
Fast spherical Fourier algorithms
Journal of Computational and Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kunis, Stefan, Potts, Daniel
openaire +2 more sources
Improved Fast-HotStuff Blockchian Consensus Algorithm [PDF]
Jisuanji gongcheng, 2021 The consensus process of the Fast-HotStuff blockchain consensus algorithm consists of two rounds of voting. When the leader node fails after the first round of voting, the throughput will be greatly reduced.
LI Qinan, XUE Zhihao, ZHANG Xuejun
doaj +1 more source
Enhancing HEVC Efficiency: A Novel Approach to Intra-Mode Estimation Through Hadamard Cost Analysis
IEEE AccessIn the realm of video coding, the quest for enhanced efficiency is unending. This study introduces a novel optimization in High Efficiency Video Coding (HEVC) by refining intra-mode estimation through Hadamard cost analysis.
Junaid Tariq +5 more
doaj +1 more source
Design of the Fast Algorithm for Discrete Orthogonal Transforms and Their Unified Architectures
Journal of Harbin University of Science and Technology, 2021 Discrete orthogonal transform ( DOT ) is widely used in digital image processing and video compression，and it is of great practical significance to study its fast algorithm and design of general architecture.
HUANG Hai +4 more
doaj +1 more source
Fast k-means algorithm clustering
, 2011 k-means has recently been recognized as one of the best algorithms for clustering unsupervised data. Since k-means depends mainly on distance calculation between all data points and the centers, the time cost will be high when the size of the dataset is ...
Kecman, Vojislav +4 more
core +1 more source
A Fast Algorithm for the Discrete Element Method by Contact Force Prediction [Translated]†
KONA Powder and Particle Journal, 2014 The discrete element method (DEM) takes enormous calculation time because it requires a very small time step, one small enough to represent the large frequency in the contact dynamic model.
Chiharu Tokoro +2 more
doaj +1 more source