1235 search results - page 28 / 247 » Structured Meanings in Computational Linguistics |
100
Voted
MFCS
2007
Springer
15 years 5 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
109
Voted
ISIPTA
2005
IEEE
15 years 5 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
90
Voted
ISVC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we explicitly derive a level set formulation for mean curvature flow in a Riemannian metric space. This extends the traditional geodesic active contour framework whi...
88
Voted
IWVF
2001
Springer
15 years 4 months ago
2001
Springer
In the framework of an evolutionary approach to machine learning, this paper presents the preliminary version of a learning system that uses Genetic Programming as a tool for autom...
98
Voted
ACL
2012
13 years 2 months ago
2012
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...