772 search results - page 130 / 155 » Hyper-Systolic Matrix Multiplication |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
ICA
2004
Springer
14 years 2 months ago
2004
Springer
SOBI is a blind source separation algorithm based on time decorrelation. It uses multiple time autocovariance matrices, and performs joint diagonalization thus being more robust th...
IPSN
2004
Springer
14 years 2 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
CW
2002
IEEE
14 years 1 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...