866 search results - page 50 / 174 » Algorithms for Comparing Pedigree Graphs |
PAMI
2010
13 years 7 months ago
2010
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language pr...
ICIP
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
EMMCVPR
2001
Springer
14 years 1 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
ICPP
2006
IEEE
14 years 3 months ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...