Fast Approximate Quadratic Assignment for (Brain) Graph Matching
☆16Aug 23, 2016Updated 9 years ago
Alternatives and similar repositories for FastApproximateQAP
Users that are interested in FastApproximateQAP are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆10May 8, 2023Updated 2 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Jun 13, 2020Updated 5 years ago
- Tools for generating and comparing Decorated Merge Trees, enriched persistence-based topological data descriptors.☆17Aug 27, 2022Updated 3 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Mar 3, 2020Updated 6 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 years ago
- Model for inferring MMA skill levels based on historic match data☆15Dec 22, 2015Updated 10 years ago
- CO-Optimal Transport☆42Nov 6, 2020Updated 5 years ago
- Scalable framework for comparing metric measure spaces with up to 1M points.☆16Apr 6, 2021Updated 5 years ago
- Implementation of paper "D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching"