Ristretto: Caffe-based approximation of convolutional neural networks.
-
Updated
Jul 10, 2019 - C++
Ristretto: Caffe-based approximation of convolutional neural networks.
A curated list of mathematics documents ,Concepts, Study Materials , Algorithms and Codes available across the internet for machine learning and deep learning
Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
This is my personal library of code that is common to my different projects (Photosounder, SplineEQ, Spiral and others)
DynaHist: A Dynamic Histogram Library for Java
Set of simple mathematical classes in C# (Vectors, Matrixes, Polynoms, Systems of linear equations, Integrals methods, Complex numbers, Rational numbers, Graphs, Methods for solving differential equations) + some features such as memoize (function values memorising)
Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.
Multi-level Node weighted Steiner trees - implementation of heuristics to compute them
This repo contains various exact and approximation algorithm for graph correlation clustering problems.
Implementation: Exact algorithms Dynamic programming (DYN) Exhaustive search, i.e. the generation of the entire search tree + some pruning. (EXH) Approximation algorithms Greedy 2-approximation algorithm (GREEDY) FPTAS
A simple, often-used multiprocessor scheduling (load balancing) algorithm is the LPT algorithm (Longest Processing Time) which sorts the jobs by its processing time and then assigns them to the machine with the earliest end time so far.
Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover
Graphically solve a texture packing problem with three approximate algorithms
Social network connection analysis on approximation fast algorithm
Subset Sum Problem - Analisis for Aproximation Algorithms
Memory-efficient probabilistic counter namely Morris Counter
Multiple Disjunctively Constrained Knapsak problem: definition and an approximation algorithm implementation.
A C++ implementation of the Christofides algorithm for instances in TSPLIB format
Tasks from Numerical Analysis course
Algorithms and functions for fast exponentiation with small error
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."