Sign in
parallel-df.
An OpenMP based solution for computing K-most frequent words in a corpus (see README for more). Also, my submission for Assignment 2 of Parallel Computing Course, BITS Pilani (2nd Sem 2017/18)
github.com/ankitsultana/parallel-df
by
@ankitsultana
Problem
Audience
Keep exploring
Updates
Founder
0
Product
0
No founder updates yet. Check back soon.
๐งช
staging