Results 11 to 20 of about 23,208,688 (165)
Structured matrix methods for computations on Bernstein basis polynomials [PDF]
, 2013 This thesis considers structure preserving matrix methods for computations on Bernstein polynomials whose coefficients are corrupted by noise. The ill-posed operations of greatest common divisor computations and polynomial division are considered, and it
Yang, Ning
core +6 more sources
Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication [PDF]
, 2023 Karppa & Kaski (2019) proposed a novel ``broken or ``opportunistic matrix multiplication algorithm, based on a variant of Strassen\u27s algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks.
Harris, David G.
core +1 more source
On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry
CoRR, 2016 We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the determinant polynomial) come in families that include representatives with normal forms. These normal forms will be useful
J. M. Landsberg, Mateusz Michalek
openaire +2 more sources
A fast algorithm for matrix balancing [PDF]
, 2013 As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the
Knight, Philip, Ruiz, Daniel
core +2 more sources
Journal of Computational and Applied Mathematics, 1996 The problem of finding the greatest common divisor (GCD) of a given polynomial set has interested mathematicians for a very long time and has widespread applications in several branches of control theory, matrix theory, statistics, network theory.
Mitrouli, M +2 more
openaire +3 more sources
Wireless Sensor Network Localization via Matrix Completion Based on Bregman Divergence
Sensors, 2018 One of the main challenges faced by wireless sensor network (WSN) localization is the positioning accuracy of the WSN node. The existing algorithms are arduous to use for dealing with the pulse noise that is universal and ineluctable in practical ...
Chunsheng Liu, Hong Shan, Bin Wang
doaj +1 more source
Musical instrument classification using non-negative matrix factorization algorithms [PDF]
, 2006 14.08.13 KB. Ok to add accepted version to Spiral. IEEEIn this paper, a class of algorithms for automatic classification of individual musical instrument sounds is presented.
Benetos, Emmanouil +5 more
core +1 more source
Applied Sciences, 2023 This paper introduces a novel speech enhancement approach called dominant columns group orthogonalization of the sensing matrix (DCGOSM) in compressive sensing (CS).
Vasundhara Shukla, Preety D. Swami
doaj +1 more source
Quantum-inspired algorithms in practice [PDF]
Quantum, 2020 We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for ...
Juan Miguel Arrazola +3 more
doaj +1 more source
Crop Journal, 2020 Owing to high power and accuracy and low false positive rate in our multi-locus approaches for genome-wide association studies and linkage analyses, these approaches have attracted considerable attention in plant and animal genetics.
Yangjun Wen +4 more
doaj +1 more source