ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1811.11811
  4. Cited By
An Application of Storage-Optimal MatDot Codes for Coded Matrix
  Multiplication: Fast k-Nearest Neighbors Estimation

An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation

28 November 2018
Utsav Sheth
Sanghamitra Dutta
Malhar Chaudhari
Haewon Jeong
Yaoqing Yang
J. Kohonen
Teemu Roos
P. Grover
ArXivPDFHTML

Papers citing "An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation"

4 / 4 papers shown
Title
Root of Unity for Secure Distributed Matrix Multiplication: Grid
  Partition Case
Root of Unity for Secure Distributed Matrix Multiplication: Grid Partition Case
R. A. Machado
Felice Manganiello
22
9
0
03 Jun 2022
Stream Iterative Distributed Coded Computing for Learning Applications
  in Heterogeneous Systems
Stream Iterative Distributed Coded Computing for Learning Applications in Heterogeneous Systems
H. Esfahanizadeh
Alejandro Cohen
Muriel Médard
27
7
0
27 Apr 2022
Flexible Distributed Matrix Multiplication
Flexible Distributed Matrix Multiplication
Weiqi Li
Zhen Chen
Zhiying Wang
S. Jafar
Hamid Jafarkhani
37
6
0
22 Jul 2021
Slow and Stale Gradients Can Win the Race: Error-Runtime Trade-offs in
  Distributed SGD
Slow and Stale Gradients Can Win the Race: Error-Runtime Trade-offs in Distributed SGD
Sanghamitra Dutta
Gauri Joshi
Soumyadip Ghosh
Parijat Dube
P. Nagpurkar
34
194
0
03 Mar 2018
1