Results 31 to 40 of about 1,734,778 (295)

On minimal N+– rank graphs

Electronic Notes in Discrete Mathematics, 2004
Abstract Liptak and Tuncel in [Liptak L. and Tuncel L. The stable set problem and the lift-and-project ranks of graphs, Mathematical Programming B 98 (2003) 319–353] study the minimum number of nodes needed in a graph to have N + – rank k, proving that it is at least 3k. They conjecture that, for any k, there is a k–minimal graph, i.e.
Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini   +2 more
openaire   +1 more source

A Dichotomy Theorem for Ordinal Ranks in MSO [PDF]

Logical Methods in Computer Science
We focus on formulae $\exists X.\, φ(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set.
Damian Niwiński, Paweł Parys, Michał Skrzypczak   +2 more
doaj   +1 more source

Structures, Ranks and Minimal Distances of Cyclic Codes over ${\mathbb{Z}}_{p^2}+u{\mathbb{Z}}_{p^2}$

Mathematics
Let p be a prime and Fp a finite field of order p. This paper investigates cyclic codes over the ring Rp2,u=Zp2+uZp2 of order p4, where the nilpotent element u satisfies u2=0 and pu≠0.
Sami H. Saif
doaj   +1 more source

Using Low-Rank Approximations to Speed Up Kernel Logistic Regression Algorithm

IEEE Access, 2019
Logistic regression as a classic classification algorithm has limitations that can only be applied to linearly separable data. For linearly indivisible data, we use a kernel trick to map it to a higher dimensional space, making it easier to separate and ...
Dajiang Lei, Jianyang Tang, Zhixing Li, Yu Wu   +3 more
doaj   +1 more source

Minimal CP rank

The Electronic Journal of Linear Algebra, 2001
An \(n \times n\) matrix \(A\) is called a completely positive (\(cp\)) matrix if there exists an entrywise nonnegative (not necessarily square) matrix \(B\) such that \(A=BB^T\). The minimal \(m\) for which there exists an \(m \times n\) nonnegative matrix \(B\) satisfying \(A=BB^T\) is called the \(cp\)-rank of \(A\) and denoted by \(cp\)-rank of \(A\
openaire   +2 more sources

Ranking and Empirical Minimization of U-statistics

The Annals of Statistics, 2008
The problem of ranking/ordering instances, instead of simply classifying them, has recently gained much attention in machine learning. In this paper we formulate the ranking problem in a rigorous statistical framework. The goal is to learn a ranking rule for deciding, among two instances, which one is "better," with minimum ranking risk.
Clémençon, Stéphan, Lugosi, Gábor, Vayatis, Nicolas   +2 more
openaire   +4 more sources

Rank Minimization for Snapshot Compressive Imaging [PDF]

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2019
18 pages, 21 figures, and 2 tables.
Yang Liu 0146, Xin Yuan 0002, Jin-Li Suo, David J. Brady, Qionghai Dai   +4 more
openaire   +4 more sources

Commutative algebras of minimal rank

, 1983
If A is a finite-dimensional associative k-algebra with unit, then its rank R(A), i.e. its bilinear complexity, is never less than 2dimA−#M(A). A is said to be of minimal rank if R(A)=2dimA−#M(A).
Heintz, Joos, de Groote, Hans F.
core   +1 more source

Characterization of Certain Minimal Rank Designs

Journal of Combinatorial Theory, Series A, 1998
The authors obtain various results on designs. The main result is the proof that the all-ones vector is in the binary code of a symmetric design with \(v=2^{2m}\), \(k=2^{2m-1}- 2^{m-1}\), \(\lambda= 2^{2m-2}- 2^{m-1}\).
Gary McGuire, Harold N. Ward
openaire   +1 more source

Enumerating Minimal Separators in Ranked Order

CoRR, 2021
Error in Lemma ...
openaire   +2 more sources