English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the problem of private distributed matrix multiplication underlimited resources. Coded computation has been shown to be an effective solutionin distributed matrix multiplication, both providing privacy against theworkers and boosting the computation speed by efficiently mitigatingstragglers. In this work, we propose the use of recently-introduced bivariatepolynomial codes to further speed up private distributed matrix multiplicationby exploiting the partial work done by the stragglers rather than completelyignoring them. We show that the proposed approach reduces the averagecomputation time of private distributed matrix multiplication compared to itscompetitors in the literature while improving the upload communication cost andthe workers' storage efficiency.

Speeding Up Private Distributed Matrix Multiplication via Bivariate Polynomial Codes