1951 search results - page 73 / 391 » An algorithm for improving graph partitions |
153
click to vote
PAMI
2008
15 years 4 months ago
2008
This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geo...
165
click to vote
ICASSP
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
133
click to vote
IFIP12
2007
15 years 5 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
148
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
121
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The inefficiency of separable wavelets in representing smooth edges has motivated the researchers to pursue new two dimensional transformations. One of the successful transformat...