153 search results - page 10 / 31 » Minimum cost subpartitions in graphs |
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
JMLR
2006
14 years 11 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
TKDE
2002
14 years 11 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
100
click to vote
IFIP12
2009
14 years 9 months ago
2009
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...