Results 51 to 60 of about 340,790 (164)
This paper addresses the problem of minimum mean square error channel estimator for time division duplex massive multi‐user multi‐input multi‐output systems. It is noteworthy that, the minimum mean square error has been previously proposed for multi‐cell
Muamer Hawej, Yousef R. Shayan
doaj +1 more source
Decompositions of minimum rank matrices
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barrett, Wayne +5 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The minimum rank problem for circulants
27 pages, 3 figures; to appear in Linear Algebra and its ...
Louis Deaett, Seth A. Meyer
openaire +3 more sources
Minimum vector rank and complement critical graphs [PDF]
Given a graph G, a real orthogonal representation of G is a function from its set of vertices to R^d such that two vertices are mapped to orthogonal vectors if and only if they are not neighbors. The minimum vector rank of a graph is the smallest dimension d for which such a representation exists.
Li, Xiaowei +2 more
openaire +2 more sources
RESIDUAL FORCE MINIMUM RANK UPDATE METHOD FOR DAMAGE IDENTIFICATION OF SPACE TRUSS STRUCTURES
Based on the minimum rank damage identification method,a minimum rank update method is proposed to study the damage identification of space truss structures.
JIANG Ge, FENG XiaoDong
doaj
Quantum-inspired algorithm for general minimum conical hull problems
A wide range of fundamental machine learning tasks that are addressed by the maximum a posteriori estimation can be reduced to a general minimum conical hull problem.
Yuxuan Du +3 more
doaj +1 more source
Minimum Rank of Graphs with Loops
A loop graph $\mf G$ is a finite undirected graph that allows loops but does not allow multiple edges. The set $\sym(\lG)$ of real symmetric matrices associated with a loop graph $\lG$ of order $n$ is the set of symmetric matrices $A=[a_{ij}]\in\Rnn$ such that $a_{ij}\ne 0$ if and only if $ij\in E(\lG)$.
Bozeman, Chassidy +7 more
openaire +3 more sources
Words of Minimum Rank in Deterministic Finite Automata [PDF]
The rank of a word in a deterministic finite automaton is the size of the image of the whole state set under the mapping defined by this word. We study the length of shortest words of minimum rank in several classes of complete deterministic finite automata, namely, strongly connected and Eulerian automata. A conjecture bounding this length is known as
Kari, Jarkko +2 more
openaire +4 more sources
Construction of a Uniform Access Structure Using Minimum Independent Dominating Vertices [PDF]
The most important technologies in modern society are the information security; it is founded to provide a protection to the transmitted data. Secret sharing scheme is one of the methods designated to protect the secret data. It is a method that allows a
KadhimA. Kadhim +2 more
doaj +1 more source

