Probabilistic method for the computation of the approximate product of two matrices
-
Updated
Sep 16, 2018 - C++
Probabilistic method for the computation of the approximate product of two matrices
Probabilistic Data Structures
Fast randomized algorithms for combinatorial optimization
Here's the corrected and polished version: Implementation of randomized greedy algorithms for solving the Knapsack Problem and Traveling Salesman Problem in C++. Educational project demonstrating algorithm replication, probabilistic optimization, and comparative analysis.
Basic bioinformatics algorithms implementation using c++14
Hamiltonian Cycles, as traversed by Mayoi Hachihachiji (undergrad project)
Solved tasks of "Randomized Algorithms" university course, contains implementations of main randomized algorithms.
Houses assignment submissions made in the course CS648 "Randomized Algorithms" at IIT-K in 2022-23 II Sem.
Code for the paper "Bavarian: Betweenness Centrality Approximation with Variance-Aware Rademacher Averages", by Chloe Wohlgemuth, Cyrus Cousins, and Matteo Riondato, appearing in ACM KDD'21 and ACM TKDD'23
This repository implements the Karger's Algorithm to find the minimum cut for a given graph.
efficiently linear regression
Add a description, image, and links to the randomized-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the randomized-algorithms topic, visit your repo's landing page and select "manage topics."