7 citations · 27 across the 13 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.IT2018
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation
Utsav Sheth, Sanghamitra Dutta, Malhar Chaudhari +5
We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix…
math.CO2018
Counting graded lattices of rank three that have few coatoms
Jukka Kohonen
We consider the problem of computing , the number of unlabeled graded lattices of rank that contain coatoms and atoms. More specifically we do this when is…
math.CO2018★ 1 cited
Exponential lower bounds of lattice counts by vertical sum and 2-sum
Jukka Kohonen
We consider the problem of finding lower bounds on the number of unlabeled -element lattices in some lattice family. We show that if the family is closed under vertical sum, exp…