5889 search results - page 464 / 1178 » Graph Layout Problems |
220
click to vote
SODA
2012
ACM
13 years 10 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
255
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
234
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
206
click to vote
WSDM
2010
ACM
16 years 5 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
189
click to vote
WEA
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...