Results 261 to 270 of about 1,734,778 (295)
Some of the next articles are maybe not open access.
On Associative Algebras of Minimal Rank
Lecture Notes in Computer Science, 1986Joos Ulrich Heintz
exaly +2 more sources
Networks, 1996
Summary: A \(k\)-ranking, \(f\), for a graph \(G\) is a function \(f:V(G) \to \{1,2, \dots, k\}\) such that if \(u\), \(v\in V(G)\) and \(f(u) = f(v)\), then every \(u\)--\(v\) path contains a vertex \(w\) such that \(f(w) > f(u)\). We define minimal rankings of graphs. Properties of minimal rankings are established and then used to determine \(\chi_r\)
J. Ghoshal, Renu C. Laskar, Dan Pillone
openaire +3 more sources
Summary: A \(k\)-ranking, \(f\), for a graph \(G\) is a function \(f:V(G) \to \{1,2, \dots, k\}\) such that if \(u\), \(v\in V(G)\) and \(f(u) = f(v)\), then every \(u\)--\(v\) path contains a vertex \(w\) such that \(f(w) > f(u)\). We define minimal rankings of graphs. Properties of minimal rankings are established and then used to determine \(\chi_r\)
J. Ghoshal, Renu C. Laskar, Dan Pillone
openaire +3 more sources
Linear Operators Preserving the Minimal Rank
Linear Algebra and Its Applications, 1999 The minimal rank of a square matrix is studied, and the linear operators preserving it are characterized.
Wasin So
exaly +2 more sources
Minimal Rank Weighted Weak Drazin Inverses [PDF]
Electronic Journal of Linear AlgebraThe concept of a minimal rank weak Drazin inverse for square matrices is extended to rectangular matrices. Precisely, a minimal rank weighted weak Drazin inverse is introduced and its properties are investigated.
Dijana Mosic
exaly +2 more sources
Radiometric Calibration by Rank Minimization
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013We present a robust radiometric calibration framework that capitalizes on the transform invariant low-rank structure in the various types of observations, such as sensor irradiances recorded from a static scene with different exposure times, or linear structure of irradiance color mixtures around edges.
Joon-Young Lee +4 more
openaire +3 more sources
On Minimal Rank Over Finite Fields [PDF]
Electronic Journal of Linear Algebra, 2006 Let F be a field. Given a simple graph G on n vertices, its minimal rank (with respect to F) is the minimum rank of a symmetric n × n F-valued matrix whose off-diagonal zeroes are the same as in the adjacency matrix of G. If F is finite, then for every k,
Guoli Ding
exaly +2 more sources
Geometric Dual and Sum-Rank Minimal Codes
Journal of Combinatorial DesignsInternational audienceAbstract The main purpose of this paper is to further study the structure, parameters and constructions of the recently introduced minimal codes in the sum‐rank metric. These objects form a bridge between the classical minimal codes
Martino Borello, Ferdinando Zullo
exaly +2 more sources
Improved thresholds for rank minimization
2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to succeed at finding the low rank solution. We find tight conditions for these and analyze them for the case where the linear measurement operator consists of i.i.d.
Oymak, Samet +2 more
openaire +2 more sources
Generalizations of Deissler's Minimality Rank
The Journal of Symbolic Logic, 1988This is the first of two papers based on Chapter V of the author's Ph.D. thesis [K1]. The second paper [K3] will deal with a specific application of the ideas presented here to the study of modules, mostly to questions concerning the complexity of injective modules over a commutative Noetherian ring.
openaire +2 more sources