Results 31 to 40 of about 332,055 (262)
On the minimum vector rank of multigraphs [PDF]
The Electronic Journal of Linear Algebra, 2010 The minimum vector rank (mvr) of a graph over a field F is the smallest d for which a faithful vector representation of G exists in F d . For simple graphs, minimum semidefinite rank (msr) and minimum vector rank differ by exactly the number of isolated vertices.
Mitchell, Lon +2 more
openaire +2 more sources
Materials Research Express, 2022 Technique for order preference by similarity to ideal solution (TOPSIS) is a well-known multi attribute decision making (MADM) method and it has been widely used in materials selection.
Won-Chol Yang +4 more
doaj +1 more source
An Improving Approach for Top-Rank- Frequent Pattern Mining
Vietnam Journal of Computer Science, 2022 Mining frequent patterns (FPs) received a lot of research interest which is a fundamental problem in the field of data mining. It has been studied on many database types with various applications in intelligent systems.
Ham Nguyen
doaj +1 more source
Frontiers in Signal Processing, 2023 Independent component analysis (ICA) has been widely used for electroencephalography (EEG) analyses. However, ICA performance relies on several crucial assumptions about the data.
Hyeonseok Kim +8 more
doaj +1 more source
Selection and Experimentation of the Best Hybrid Green Composite Using Advanced MCDM Methods for Clean Sustainable Energy Recovery: A Novel Approach [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2020 Relevant and appropriate selection of best hybrid material is a challenging task for the recent industries. The mandatory criterion is to deal with the enhanced productivity with minimum cost.
Soutrik Bose +2 more
doaj +1 more source
Lower Bounds in Minimum Rank Problems
Linear Algebra and its Applications, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitchell, Lon +2 more
openaire +3 more sources
On the minimum skew rank of graphs [PDF]
ScienceAsia, 2014 The minimum skew rank mr (F;G) of a graphG over a field F is the smallest possible rank among all skew symmetric matrices over F whose (i;j)th entry (for i 6 j) is non-zero whenever ij is an edge in G and is zero otherwise. We characterize the graphs G with cut vertices over an infinite field F such that mr (F;G) = 4 determine the minimum skew rank of ...
Yanna Wang, Bo Zhou
openaire +1 more source
Minimum rank of powers of trees [PDF]
The Electronic Journal of Linear Algebra, 2012 The minimum rank of a simple graph G over a field F is the smallest possible rank among all real symmetric matrices, over F, whose (i, j)-entry (for i 6= j) is nonzero whenever ij is an edge in G and is zero otherwise. In this paper, the problem of minimum rank of (strict) powers of trees is studied.
Luz DeAlba +5 more
openaire +1 more source
Low-Rank Matrix Recovery from Noise via an MDL Framework-Based Atomic Norm
Sensors, 2020 The recovery of the underlying low-rank structure of clean data corrupted with sparse noise/outliers is attracting increasing interest. However, in many low-level vision problems, the exact target rank of the underlying structure and the particular ...
Anyong Qin +4 more
doaj +1 more source
A note on the minimum rank of graphs with given dominating induced subgraph
The American Journal of CombinatoricsAn induced subgraph of a graph \(G\) is said to be dominating if every vertex of \(G\) is at distance at most one from this subgraph. We investigate pairs \((G, F)\) where \(F\) is a non-singular dominating induced subgraph of \(G,\) and the rank of \(G\
Zoran Stanić
doaj +1 more source