1605 search results - page 104 / 321 » On Partitional Labelings of Graphs |
115
click to vote
EMNLP
2010
14 years 10 months ago
2010
We present a novel approach to relation extraction that integrates information across documents, performs global inference and requires no labelled text. In particular, we tackle ...
126
click to vote
ECRTS
2010
IEEE
15 years 1 months ago
2010
IEEE
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
154
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
ICCV
2007
IEEE
16 years 2 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...
106
Voted
ECEASST
2010
14 years 10 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...