Name
Abstract | ||
|---|---|---|
We propose an $O(Ncdot M)$ sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we discuss the application of this algorithm to sparse hash table. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Learning | Sorting,Acceleration,Artificial intelligence,Parallel sorting,Big data,Sorting algorithm,Machine learning,Mathematics,Hash table |
DocType | Volume | Citations |
Journal | abs/1805.04272 | 1 |
PageRank | References | Authors |
0.35 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hanqing Zhao | 1 | 4 | 5.83 |
| Yuehan Luo | 2 | 1 | 0.35 |