Results 191 to 200 of about 55,699 (240)
Time-of-Flow Distributions in Discrete Quantum Systems: From Operational Protocols to Quantum Speed Limits. [PDF]
Entropy (Basel)Beau M.
europepmc +1 more source
Knowledge-graph-enhanced multi-scale modeling for drug-drug interaction prediction. [PDF]
Mol Ther Nucleic AcidsChen J +9 more
europepmc +1 more source
Feature Augmentation-Based Adaptive Neural Network Control for Quadrotors. [PDF]
Sensors (Basel)Song B, Huang M.
europepmc +1 more source
Multi-omics data integration for enhanced cancer subtyping via interactive multi-kernel learning. [PDF]
Brief BioinformCao H +11 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Positivity Preserving Hadamard Matrix Functions
Positivity, 2007The authors prove that for every positive real number \(p\) that lies between even integers \(2(m-2)\) and \(2(m-1)\), there exists a matrix \(A=(a_{ij})\) of order \(2m\) such that \(A\) is positive definite, but the matrix with entries \(| a_{ij}| ^p\) is not.
Bhatia, Rajendra, Elsner, Ludwig
openaire +2 more sources
2010 IEEE International Symposium on Information Theory, 2010
We apply the Hadamard equivalence to all the binary matrices of size m × n and study various properties of this equivalence relation and its classes. We propose to use HR-minimal as a representative of each equivalence class and count the number of HR-minimals of size m × n for m ≤ 3.
Ki-Hyeon Park, Hong-Yeop Song
openaire +1 more source
We apply the Hadamard equivalence to all the binary matrices of size m × n and study various properties of this equivalence relation and its classes. We propose to use HR-minimal as a representative of each equivalence class and count the number of HR-minimals of size m × n for m ≤ 3.
Ki-Hyeon Park, Hong-Yeop Song
openaire +1 more source
Journal of Mathematical Techniques and Computational Mathematics, 2023
The Hadamard Matrix Conjecture has been an open problem for decades. In this paper, we attempt to solve the problem of the existence of Hadamard Matrices. The solution is that the rank of a square matric must be divisible by 4. We use AT Math to solve this problem.
openaire +1 more source
The Hadamard Matrix Conjecture has been an open problem for decades. In this paper, we attempt to solve the problem of the existence of Hadamard Matrices. The solution is that the rank of a square matric must be divisible by 4. We use AT Math to solve this problem.
openaire +1 more source
Euler Hadamard/DCT polynomial matrix
Applied Mathematics and Computation, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Moon Ho +2 more
openaire +1 more source
1997
A Hadamard matrix, H = (h ij ) is defined as a square matrix of dimension nxn where: i All entries are ±1. ii Any two distinct rows are orthogonal, ie, ∀ i, j, i ≠ j \( \sum\limits_k {{h_{{ik}}}} {h_{{jk}}} = 0 \)
R. K. Rao Yarlagadda, John E. Hershey
openaire +1 more source
A Hadamard matrix, H = (h ij ) is defined as a square matrix of dimension nxn where: i All entries are ±1. ii Any two distinct rows are orthogonal, ie, ∀ i, j, i ≠ j \( \sum\limits_k {{h_{{ik}}}} {h_{{jk}}} = 0 \)
R. K. Rao Yarlagadda, John E. Hershey
openaire +1 more source