This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices"
The movement of data (communication) between levels of a memory hierarchy, or between parallel proce...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors n...
AbstractWe consider the set of m×n nonnegative real matrices and define the nonnegative rank of a ma...
The rank of a matrix seems to play a role in the context of communication complexity, a framework de...
AbstractThe rank of a matrix seems to play a role in the context of communication complexity, a fram...
The nonnegative rank of an entrywise nonnegative matrix A ∈ R[m×n over +] is the smallest integer r ...
AbstractThe notion of communication complexity seeks to capture the amount of communication between ...
Abstract—This paper studies the low-rank matrix completion problem from an information theoretic per...
We prove that several measures in communication complexity are equivalent, up to polynomial factors ...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
Identifying complexity measures that bound the communication complexity of a {0,1}-valued matrix M i...
SIGLETIB Hannover: RO 3318(70) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...
This paper concerns the open problem of Lov'asz and Saks regarding the relationship between th...
Nonnegative matrix factorization (NMF) consists in finding two nonnegative matrices whose product is...
The movement of data (communication) between levels of a memory hierarchy, or between parallel proce...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors n...
AbstractWe consider the set of m×n nonnegative real matrices and define the nonnegative rank of a ma...
The rank of a matrix seems to play a role in the context of communication complexity, a framework de...
AbstractThe rank of a matrix seems to play a role in the context of communication complexity, a fram...
The nonnegative rank of an entrywise nonnegative matrix A ∈ R[m×n over +] is the smallest integer r ...
AbstractThe notion of communication complexity seeks to capture the amount of communication between ...
Abstract—This paper studies the low-rank matrix completion problem from an information theoretic per...
We prove that several measures in communication complexity are equivalent, up to polynomial factors ...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
Identifying complexity measures that bound the communication complexity of a {0,1}-valued matrix M i...
SIGLETIB Hannover: RO 3318(70) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...
This paper concerns the open problem of Lov'asz and Saks regarding the relationship between th...
Nonnegative matrix factorization (NMF) consists in finding two nonnegative matrices whose product is...
The movement of data (communication) between levels of a memory hierarchy, or between parallel proce...
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors n...
AbstractWe consider the set of m×n nonnegative real matrices and define the nonnegative rank of a ma...