41 search results - page 3 / 9 » Unsupervised Cosegmentation based on Global Graph Matching |
85
Voted
CEC
2007
IEEE
15 years 5 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
SEMWEB
2007
Springer
15 years 5 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
120
click to vote
ECAI
2008
Springer
15 years 27 days ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
IJCAI
2007
15 years 17 days ago
2007
In this paper we revisit the classical NLP problem of prepositional phrase attachment (PPattachment). Given the pattern V −NP1−P −NP2 in the text, where V is verb, NP1 is a ...