Results 271 to 280 of about 85,829 (307)
Some of the next articles are maybe not open access.
IEEE Transactions on Information Theory, 1993
Summary: Given positive integers \(r\), \(s\), \(u\), and \(v\), an \((r, s; u, v)\) perfect map is defined to be a periodic \(r\times s\) binary array in which every \(u\times v\) binary array appears exactly once as a periodic subarray. Perfect maps are the natural extension of the de Bruijn sequences to two dimensions.
openaire +1 more source
Summary: Given positive integers \(r\), \(s\), \(u\), and \(v\), an \((r, s; u, v)\) perfect map is defined to be a periodic \(r\times s\) binary array in which every \(u\times v\) binary array appears exactly once as a periodic subarray. Perfect maps are the natural extension of the de Bruijn sequences to two dimensions.
openaire +1 more source
Perfect lens with not so perfect boundaries
Optics Letters, 2009In manufacturing left-handed media the interfaces will never be perfect; defects and other disturbances to interfaces and material parameters are unavoidable. We report an analytical calculation of electromagnetic wave propagation through a perfect lens with diffuse boundaries.
P C, Ingrey +3 more
openaire +2 more sources
A generalization of perfect graphs?i-perfect graphs
Journal of Graph Theory, 1996The \(i\)-chromatic number of \(G\), denoted \(\chi_i(G)\), is the least number \(k\) such that there is a \(k\)-colouring with no colour class inducing a \(K_{i+1}\) as a subgraph. The \(i\)-clique number, \(\omega_i(G)\), is defined to be \(\lceil \omega(G)/i\rceil\). An induced subgraph \(H\) of \(G\) is an \(i\)-transversal iff \(\omega(H)= i\) and
Leizhen Cai, Derek G. Corneil
openaire +2 more sources
Rank-perfect and" weakly rank-perfect graphs
Mathematical Methods of Operations Research (ZOR), 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Vulnerability, Perfection and Christian Education
Journal of Disability and Religion, 2023Jorge Lopez Gonzalez
exaly