882 search results - page 81 / 177 » On the Hardness of Graph Isomorphism |
EMNLP
2006
13 years 10 months ago
2006
Information Extraction (IE) is the task of extracting knowledge from unstructured text. We present a novel unsupervised approach for information extraction based on graph mutual r...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
WG
2007
Springer
14 years 2 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
WG
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
ICCS
2007
Springer
14 years 3 months ago
2007
Springer
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...