1090 search results - page 74 / 218 » Priority Algorithms for Graph Optimization Problems |
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
PAMI
2010
13 years 8 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
AICCSA
2007
IEEE
14 years 4 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
PPAM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...