940 search results - page 63 / 188 » Learning Word Representations from Relational Graphs |
143
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
128
click to vote
IDA
2007
Springer
15 years 3 months ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
143
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
155
click to vote
JAIR
2010
15 years 2 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
153
Voted
CVIU
2011
14 years 7 months ago
2011
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...