Results 81 to 90 of about 23,208,688 (165)

Options to Use Data Matrix Codes in Production Engineering

open access: yesManagement Systems in Production Engineering, 2018
The paper deals with the possibilities of using Data Matrix codes in production engineering. We designed and tested the computationally efficient method for locating the Data Matrix code in the images.
Karrach Ladislav, Pivarčiová Elena
doaj   +1 more source

Coherent DOA estimation based on low-rank matrix recovery with coprime arrays in nonuniform noise

open access: yesEURASIP Journal on Advances in Signal Processing
In this paper, a novel low-rank matrix recovery-based direction of arrival estimation algorithm is proposed for coherent signals with coprime arrays under nonuniform noise conditions.
Youzhen Yang, Jianhui Wang, Zhenyu Wang
doaj   +1 more source

Using underapproximations for sparse nonnegative matrix factorization [PDF]

open access: yes
Nonnegative Matrix Factorization (NMF) has gathered a lot of attention in the last decade and has been successfully applied in numerous applications.
GILLIS, Nicolas, GLINEUR, François
core  

Parallel Algorithms for Tensor Completion in the CP Format

open access: yes, 2015
Low-rank tensor completion addresses the task of filling in missing entries in multi-dimensional data. It has proven its versatility in numerous applications, including context-aware rec-ommender systems and multivariate function learning.
Kressner, Daniel   +6 more
core   +1 more source

On the Parallel Complexity of Matrix Factorization Algorithms

open access: yes, 1996
ll;eprove allulllberof negaLive resultsahout practicaf (i.e., numerically accurate) algorithms for certain matrix factorization. In particular. we prow that the popular (;iwns’ method for computing the QR decomposition is inherentl} sequential over ...
G. MANZINI   +5 more
core   +1 more source

Optimal solution of the nearest correlation matrix problem by minimization of the maximum norm [PDF]

open access: yes
The nearest correlation matrix problem is to find a valid (positive semidefinite) correlation matrix, R(m,m), that is nearest to a given invalid (negative semidefinite) or pseudo-correlation matrix, Q(m,m); m larger than 2.
Mishra, SK
core  

Project schedule optimisation utilising genetic algorithms [PDF]

open access: yes, 2007
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis extends the body of research into the application of Genetic Algorithms to the Project Scheduling Problem (PSP). A thorough literature review is
Lancaster, John
core   +2 more sources

Prediction of Power Grid Material demand based on Based on matrix decomposition

open access: yes四川大学学报. 自然科学版, 2019
It is of great significance to accurately predict the material demand of substation and distribution network for saving project cost and improving capital utilization. Researchers have carried out a series of studies on power material demand forecasting,
wangzhujun, zhuyingqi, sunjieping
doaj  

Algorithms for analysis and synthesis of systems with synchronization errors

open access: yes, 2012
This thesis addresses currently open problems in the stability analysis and control of discrete linear systems with clock synchronisation errors. Such errors can lead to insta- bility of an overall system even in the case when it is composed of linear ...
Przedwojski, Marek
core  

Computation of least order solutions of linear rational equations [PDF]

open access: yes, 2004
We propose a numerically reliable approach for computing solutions of least McMillan order of linear equations with rational matrix coefficients. The main computational ingredients are the orthogonal reduction of the associated system matrix pencil to a ...
A. Varga, Varga, Andras
core  

Home - About - Disclaimer - Privacy