Computing a Nonnegative Matrix Factorization---Provably (Q2817794): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ravindran Kannan / rank
Normal rank
 
Property / author
 
Property / author: Ravindran Kannan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/130913869 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2507533531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a nonnegative matrix factorization -- provably / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial and algebraic complexity of quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/jmlr.2003.3.4-5.993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of partitions of a set of <i>N</i> points in <i>k</i> dimensions induced by hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of separable partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity and combinatorial lattice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Optimal Algorithm for Computing Nonnegative Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new decision method for elementary algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonnegative Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 11:59, 12 July 2024

scientific article
Language Label Description Also known as
English
Computing a Nonnegative Matrix Factorization---Provably
scientific article

    Statements

    Computing a Nonnegative Matrix Factorization---Provably (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2016
    0 references
    nonnegative matrix factorization
    0 references
    separability
    0 references
    provable algorithms
    0 references

    Identifiers