Cargando…
Fast Approximate Quadratic Programming for Graph Matching
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valu...
Autores principales: | Vogelstein, Joshua T., Conroy, John M., Lyzinski, Vince, Podrazik, Louis J., Kratzer, Steven G., Harley, Eric T., Fishkind, Donniell E., Vogelstein, R. Jacob, Priebe, Carey E. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4401723/ https://www.ncbi.nlm.nih.gov/pubmed/25886624 http://dx.doi.org/10.1371/journal.pone.0121002 |
Ejemplares similares
-
On a two-truths phenomenon in spectral graph clustering
por: Priebe, Carey E., et al.
Publicado: (2019) -
Bisected graph matching improves automated pairing of bilaterally homologous neurons from connectomes
por: Pedigo, Benjamin D., et al.
Publicado: (2023) -
Are mental properties supervenient on brain properties?
por: Vogelstein, Joshua T., et al.
Publicado: (2011) -
An automated images-to-graphs framework for high resolution connectomics
por: Gray Roncal, William R., et al.
Publicado: (2015) -
Inference for Multiple Heterogeneous Networks with a Common Invariant Subspace
por: Arroyo, Jesús, et al.
Publicado: (2021)