Search Sciweavers | Sciweavers

772 search results - page 13 / 155

» Hyper-Systolic Matrix Multiplication

click to vote

ENTCS
2002

207views more ENTCS 2002»

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

13 years 7 months ago

Download www.cosc.canterbury.ac.nz

We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...

Tadao Takaoka

claim paper

Read More »

click to vote

DMTCS
1998

100views Mathematics» more DMTCS 1998»

Lower bounds for sparse matrix vector multiplication on hypercubic networks

13 years 7 months ago

Download www.dmtcs.org

Giovanni Manzini

claim paper

Read More »

click to vote

MST
2010

121views more MST 2010»

Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits

13 years 5 months ago

Download lovelace.thi.informatik.uni-frankfurt.de

We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We deﬁne the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...

Stasys Jukna

claim paper

Read More »

click to vote

TCS
2011

163views Theoretical Computer Science» more TCS 2011»

Optimization techniques for small matrix multiplication

13 years 2 months ago