Implementation of a dynamic hard clustering algorithm based on multiple dissimilarity matrices
-
Updated
Nov 16, 2017 - C++
Implementation of a dynamic hard clustering algorithm based on multiple dissimilarity matrices
Complex ray tracing algorithm optimized by using parallelization over different partitioning schemes and explore the performance gains through grain size and processing units (parameters) over sequential algorithm to render a high resolution image.
A program to distribute sheet music parts to players, minimizing movement of players between pieces.
Coursework of NTHU CS516000 FPGA Architecture & CAD
Coursework of NTHU CS613500 VLSI Physical Design Automation
Algorithms for some classical problems
A C++ program to split any amount to coins & notes.
A C++ implementation of the Quad-Tree spatial index.
Codes pertaining to OS Lab for Course CO254 - Operating Systems[CSE NITK SEM-4]
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
KaHIP -- Karlsruhe HIGH Quality Partitioning.
Header-Only C++ Library for Graph Representation and Algorithms
Add a description, image, and links to the partitioning-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the partitioning-algorithms topic, visit your repo's landing page and select "manage topics."