—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...