Fast Approximate Quadratic Programming for Large (Brain) Graph Matching (Q6229882)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast Approximate Quadratic Programming for Large (Brain) Graph Matching |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Approximate Quadratic Programming for Large (Brain) Graph Matching |
preprint article from arXiv |
Statements
22 December 2011
0 references
math.OC
0 references
cs.DS
0 references
q-bio.NC
0 references
Joshua T. Vogelstein
0 references
John M. Conroy
0 references
Vince Lyzinski
0 references
Louis J. Podrazik
0 references
Steven G. Kratzer
0 references
Eric T. Harley
0 references
Donniell E. Fishkind
0 references
R. Jacob Vogelstein
0 references
Carey E. Priebe
0 references
