688 search results - page 59 / 138 » Comparison of Conceptual Graphs |
PR
2006
14 years 9 months ago
2006
In this paper a completely automatic face recognition system is presented. The method works on color images: after having localized the face and the facial features, it determines...
MICCAI
2006
Springer
15 years 10 months ago
2006
Springer
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
ICSM
2009
IEEE
15 years 4 months ago
2009
IEEE
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
147
click to vote
ECCV
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...