Unsupervised Learning for Image Registration

Bloom filter for Scala, the fastest for JVM

PyTorch based Probabilistic Time Series forecasting framework based on GluonTS backend

Quickly detect already witnessed data.

《概率机器人》书和课后习题

ProbLog is a Probabilistic Logic Programming Language for logic programs with probabilities.

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

Depth-Based Bayesian Object Tracking Library

Density Adaptive Point Set Registration

Counter Data structure for Golang using CountMin Sketch with a fixed amount of memory

🎲 Efficient Java implementation of the probabilistic Earley algorithm to parse Stochastic Context Free Grammars (SCFGs)

An in-memory bloom filter with persistence and HTTP interface

Probabilistic Dialogue Act Classification for the Switchboard Corpus using an LSTM model

Probabilistic plane extraction

JudgeD: Probabilistic Datalog with Dependencies

Count-Min Sketch Implementation in C

Probabilistic data structures java implementation.

A fairly robust LeetSpeak to English converter using probability of word usage

A pure, simple and fast pythonic bloom filter

Bloom filter implementation

Scala embedded universal probabilistic programming language

This algorithm is a probabilistic approach for approximating the global optimum for the Simple Assembly Line Balancing Problem.

High-Performance Model Checker developed for multicore, multiprocessors machines (NUMA).

Implementation of Probabilistic RSA and Textbook RSA using GNU MP library in C++. The probabilistic implementation supports homomorphic multiplication.

A novel, space-efficient, probabilistic data structure for hashing a large number of values. It is similar to a hash table, but smaller because it does not need to store the entire value like HashTable and has better asymptotic performance, at the cost of possible false-positives, a likelihood that is configurable. False negatives are not possible. Best use case: Lightweight check if a value/query exists to reject needless/bogus call in place before performing a more latent or expensive request, such as a search for content or database call.

Implementation of a probabilistic version of the CYK algorithm

HyperLogLog implementations.

Includes implementation of PRM,RRT and Potential Field Planner(Self implementaiton)