Pages that link to "Item:Q436566"
From MaRDI portal
The following pages link to On the nonnegative rank of distance matrices (Q436566):
Displayed 16 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Matrix product constraints by projection methods (Q1675556) (← links)
- A novel semi-supervised learning method for Internet application identification (Q1701707) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Learning without loss (Q2138443) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- An upper bound for nonnegative rank (Q2341256) (← links)
- Symmetric nonnegative matrix trifactorization (Q2693700) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q4612478) (← links)
- A separation between tropical matrix ranks (Q5055609) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
- Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)