-
Notifications
You must be signed in to change notification settings - Fork 0
Implementation of the Greedy Max Cut algorithm of Rohde 2002 (https://pubmed.ncbi.nlm.nih.gov/11972914/) for transformation of pairwise rated psychophysical distances into vectors with similar overlap (hamming distances). The intended use is as input to a 2D recurrent neural network.
robban80/greedy_max_cut
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of the Greedy Max Cut algorithm of Rohde 2002 (https://pubmed.ncbi.nlm.nih.gov/11972914/) for transformation of pairwise rated psychophysical distances into vectors with similar overlap (hamming distances). The intended use is as input to a 2D recurrent neural network.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published