6598 search results - page 271 / 1320 » Graph Theory with Applications |
160
click to vote
STACS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
178
click to vote
LREC
2010
15 years 8 months ago
2010
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
152
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
171
click to vote
ICDM
2006
IEEE
16 years 19 days ago
2006
IEEE
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
180
click to vote
IBIS
2006
15 years 6 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...