Ristretto: Caffe-based approximation of convolutional neural networks.
-
Updated
Jul 10, 2019 - C++
Ristretto: Caffe-based approximation of convolutional neural networks.
Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.
Graphically solve a texture packing problem with three approximate algorithms
A C++ implementation of the Christofides algorithm for instances in TSPLIB format
Real-time Interactive Barnes-Hut N-Body Simulator. Create galaxies, apply forces, visualize spatial partitioning, parameterize simulation physics and entities, etc.
An application in c++ to solve the Travelling Salesman Problem using the Ant Colony System
Multiple Disjunctively Constrained Knapsak problem: definition and an approximation algorithm implementation.
approximation algorithms for exact nearest neighbors search and clustering on multi-dimensional vectors
Implementation of our paper "An Efficient Approximate Algorithm for Single-Source Discounted Hitting Time Query" (DASFAA2020)
Approximating the Value of π
Design of Algorithms course second project
The rectilinear traveling salesperson problem (RTSP) Remember that a coordinate is a number x∈ℜ, and in the plane, a point is a pair (x, y)∈ℜ2.
Implementation of an approximation algorithm for the Prize-Collecting Steiner Tree Problem.
This repo contains various exact and approximation algorithm for graph correlation clustering problems.
Calculating the circle number Pi.
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem @ ALENEX '22
This is a implementation of the basic B-spline approximation for a set of 2d points.
Calculating digits of pi with arbitrary size and find pattern inside.
Add a description, image, and links to the approximation-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the approximation-algorithms topic, visit your repo's landing page and select "manage topics."