681 search results - page 115 / 137 » Combining Theorem Proving with Natural Language Processing |
68
Voted
JMLR
2010
14 years 4 months ago
2010
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
95
Voted
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
72
Voted
MICCAI
2000
Springer
15 years 1 months ago
2000
Springer
In this paper, the problem of retrospective correction of intensity inhomogeneity in magnetic resonance (MR) images is addressed. A novel model-based correction method is proposed,...
FSMNLP
2005
Springer
15 years 3 months ago
2005
Springer
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
107
click to vote
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...