Search
Now showing items 1-9 of 9
Theorems on positive data: on the uniqueness of NMF.
(2008)
We investigate the conditions for which nonnegative matrix factorization (NMF) is unique and introduce several theorems which can determine whether the decomposition is in fact unique or not. The theorems are illustrated ...
Generalized face super-resolution
(2008-06)
Classification of the asymptotic Proof Complexity of Polynomial Calculus
(Springer, 2008)
We show that the asymptotic complexity of uniformly
generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS)
as well as for Polynomial Calculus, (PC) has four ...