Scalable and Sustainable Deep Learning via Randomized Hashing
-
Updated
Aug 16, 2017 - Java
Scalable and Sustainable Deep Learning via Randomized Hashing
Randomized Heuristic for the Maximum Clique Problem
Randomized SVD as per Halko, Martinsson, and Tropp [2011]
network flow #dynamic-programming
Java code for randomized and deterministic QuickSelect algorithms, as well as a naive sorting algorithm. QuickSelect provides efficient selection of specific elements within an unsorted array. The code includes both randomized and deterministic pivot selection strategies comparing with naive built-in implementation.
Add a description, image, and links to the randomized-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the randomized-algorithm topic, visit your repo's landing page and select "manage topics."