2784 search results - page 245 / 557 » Relation Extraction with Relation Topics |
162
click to vote
NIPS
2004
15 years 6 months ago
2004
In this paper, we propose a new method, Parametric Embedding (PE), for visualizing the posteriors estimated over a mixture model. PE simultaneously embeds both objects and their c...
161
click to vote
ACL
1998
15 years 6 months ago
1998
Word sense disambiguation for unrestricted text is one of the most difficult tasks in the fields of computational linguistics. The crux of the problem is to discover a model that ...
144
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
137
Voted
JUCS
2008
15 years 5 months ago
2008
Abstract: The thematic text segmentation task consists in identifying the most important thematic breaks in a document in order to cut it into homogeneous passages. We propose in t...
129
Voted
COMBINATORICS
2002
15 years 4 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...