Results 61 to 70 of about 340,790 (164)
Graph theory versus minimum rank for index coding [PDF]
2014 IEEE International Symposium on Information Theory, 2014 We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic factor from the chromatic number.
Karthikeyan Shanmugam 0001 +2 more
openaire +4 more sources
Blind Reduced-Rank MMSE Detector for DS-CDMA Systems
EURASIP Journal on Advances in Signal Processing, 2002 We first develop a reduced-rank minimum mean squared error (MMSE) detector for direct-sequence (DS) code division multiple access (CDMA) by forcing the linear MMSE detector to lie in a signal subspace of a reduced dimension.
Ge Hongya, Akansu Ali N, Cai Xiaodong
doaj +1 more source
Scientific Papers Animal Science and Biotechnologies, 2023 The present work was carried out to determine the influence of lactation rank on the milk yield, fat and protein evolution. Observations were carried out on 117 lactations, as follows: 15 first lactations, 22 second lactations, 26 third lactations, 28 ...
Florin Cristian Neciu +4 more
doaj
Recent Trends in Temperature and Precipitation in the Langat River Basin, Malaysia
Advances in Meteorology, 2015 A study was undertaken to detect long-term trends in the annual and seasonal series of maximum and minimum temperatures. Measurements were taken at 11 meteorological stations located in the Langat River Basin in Malaysia.
Mahdi Amirabadizadeh +2 more
doaj +1 more source
On generalized Hadamard matrices of minimum rank
Finite Fields and Their Applications, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Minimum rank of outerplanar graphs
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sinkovic, John, Kempton, Mark
openaire +2 more sources
Kneser Ranks of Random Graphs and Minimum Difference Representations [PDF]
SIAM Journal on Discrete Mathematics, 2017 Every graph $G=(V,E)$ is an induced subgraph of some Kneser graph of rank $k$, i.e., there is an assignment of (distinct) $k$-sets $v \mapsto A_v$ to the vertices $v\in V$ such that $A_u$ and $A_v$ are disjoint if and only if $uv\in E$. The smallest such $k$ is called the Kneser rank of $G$ and denoted by $f_{\rm Kneser}(G)$.
Zoltán Füredi, Ida Kantor
openaire +4 more sources
Reliability Analysis of Small-Sample Failure Data for Random Truncation High-Voltage Relay
Applied SciencesIn order to model and evaluate the reliability of long-life high-voltage relays with small-sample fault data characteristics, a reliability analysis method integrating average rank, the minimum mean square distance empirical distribution function, and ...
Yingzhi Zhang +4 more
doaj +1 more source
On the Rank, Order and Class of Algebraic Minimum Curves [PDF]
Transactions of the American Mathematical Society, 1902 The equations of all analytic minimum curves may be written in terms of a complex parameter s and an arbitrary analytic function F(s). The curve will be algebraic when and only when F(s) is an algebraic function, and then the rank, order and class of the curve can be easily expressed as the orders of three functions, #(s), 4(s) and X(s), (see ?
openaire +1 more source
On the BIB design having the minimum p-rank
Journal of Combinatorial Theory, Series A, 1975 AbstractIt is shown that (i) among BIB designs with parameters (2t+1 − 1, 2t+1 − 1, 2t − 1, 2t − 1, 2t−1 − 1), the incidence matrix of the BIB design PG(t, 2):t − 1 derived from a finite projective geometry PG(t, 2) has the minimum 2-rank and (ii) among BIB designs with parameters (2t, 2t+1 − 2, 2t − 1, 2−1, 2t−1 − 1), the incidence matrix of the BIB ...
N. Hamada, H. Ohmori
openaire +2 more sources