24 search results - page 4 / 5 » csl 2002 |
CSL
2002
Springer
13 years 5 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
CSL
2002
Springer
13 years 5 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
CSL
2002
Springer
13 years 5 months ago
2002
Springer
The most popular model used in automatic speech recognition is the hidden Markov model (HMM). Though good performance has been obtained with such models there are well known limit...
CSL
2002
Springer
13 years 5 months ago
2002
Springer
We describe a corpus-based approach to natural language generation (NLG). The approach has been implemented as a component of a spoken dialog system and a series of evaluations we...
CSL
2002
Springer
13 years 5 months ago
2002
Springer
A spoken language generation system has been developed that learns to describe objects in computer-generated visual scenes. The system is trained by a `show-and-tell' procedu...