STEP: Spatio-Temporal Progressive Learning for Video Action Detection. CVPR'19 (Oral)

Multi-device OpenCL kernel load balancer and pipeliner API for C#. Uses shared-distributed memory model to keep GPUs updated fast while using same kernel on all devices(for simplicity).

An iterative computing framework for both Hadoop MapReduce and Hadoop YARN.

A composable framework for fast and scalable data analytics

Sharp Image Deblurring

Command line iterative DNS resolution testing program

Library for tracking and iteratively improving page framerate over time

Implemention of the Gauss-Seidel Iterative Method for solving systems of equations.

The code from my master thesis. 100.0% Clojure.

Scientific Workflow Management Tool

Common programming algorithms written with Go Lang

Implementation of ConjugateGradients method using Python3.

The KING TeC FRC Programming Framework, built around the principles of modular code design, state management, and reliable performance, followed with error catching, limping, and redundancies.

Implementação do Segundo Trabalho de Algoritmos Numéricos 2019/1. Resolve equações de Poisson pelo método das diferenças finitas.

Calculates pi - leave it running for an increasingly close approximation of pi.

ILC - Iterative Learning Control on 2 DOF planar arm

Extension for Lime Survey - Creates automatic comment questions, and for iterative questionnaires, creates a new questionnaire from a previous round questionnaire

Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java

Fractal - Sierpinski Triangle - C

A Python package of mathematical functions, root finding, iterative solvers, numerical analysis, and more. Bisection, Newton, Euler, RK2, RK4, Adams-Bash-Moult, etc. Uses Python, NumPy, SymPy, pytest.

!= Approaches 4 != Algorithms

Pascal's triangle in both iterative and recursive methods without array.

Rotation-Based Iterative Gaussianization (RBIG) with JAX.

Iterative Genome Assembly using GATB library

A matrix library that contains multiple solvers of matrices

ParaDiag is a class of Parallel-in-Time (PinT) algorithms based on the diagonalization technique. ParaDIAG can handle both the dissipative problems (e.g., the advection-diffusion equations) and the purely wave equations (e.g., the acoustic equation).

Isomorphic nodes - Two trees are called isomorphic if one of them can be obtained from other by a series of flips, i.e. by swapping left and right children of a number of nodes.