Fast Approximate Quadratic Programming for Large (Brain) Graph Matching
Quadratic assignment problems (QAPs) arise in a wide variety of domains, ranging from operations research to graph theory to computer vision to neuroscience. In the age of big data, graph valued data is becoming more prominent, and with it, a desire to run algorithms on ever larger graphs. Because Q...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , , , , , , , , |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
13.09.2014
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!