Averaging of Decomposable Graphs by Dynamic Programming and Sampling.
Kustaa KangasTeppo Mikael NiinimäkiMikko KoivistoPublished in: UAI (2015)
Keyphrases
- dynamic programming
- graph theoretic
- greedy algorithm
- finding the shortest path
- graph theory
- graph matching
- state space
- sampling strategy
- linear programming
- optimal control
- random sampling
- graph mining
- uniform random
- monte carlo
- sampling methods
- sampling algorithm
- data sets
- single machine
- stereo matching
- undirected graph
- scheduling problem
- bipartite graph
- labeled graphs
- dp matching
- optimal policy