Cardinality matching algorithm based on Edmonds Matching Algorithm
-
Updated
May 13, 2017 - C++
Cardinality matching algorithm based on Edmonds Matching Algorithm
Second coursework for Machine Learning for Computer Vision (EE4)
Structural comparison algorithm. It can be used for finding structural patterns in data.
A toolbox for solving problems of equilibrium computation and identification in discrete choice and matching problems.
Code for paper "Non-Planar Infrared-Visible Registration for Uncalibrated Stereo Pairs" at IEEE Conference on Computer Vision and Pattern Recognition (CVPR) Workshops 2016
An in-depth tutorial on the theory of panorama stitching
Plagiarism detector in C++ for naive text file matching
Bloom Filter based Semi-Index (BFSI)
Multi AOSO on q-Grams (MAG). One of the fastest multi-pattern matching algorithms.
MAG for approximate pattern matching (MAGA)
it calculate the relatiionship between the two different input strings using c++
This is the dynamic matching code for the paper ``Dynamic Matching in Practice''.
Add a description, image, and links to the matching topic page so that developers can more easily learn about it.
To associate your repository with the matching topic, visit your repo's landing page and select "manage topics."