4674 search results - page 181 / 935 » cases 2008 |
159
click to vote
UAI
2004
15 years 7 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
104
click to vote
COLING
1996
1996
Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules
15 years 7 months ago
We describe a case study in tit(', application of symbolic machinc learning techniques for the discow;ry of linguistic rules and categories. A supervised rule induction algor...
156
click to vote
COLING
1994
15 years 7 months ago
1994
In this paper, we propose an automatic method for detecting discourse structure using a variety of clues existing in the surface information of sentences. We have considered three...
149
click to vote
COLING
1996
15 years 7 months ago
1996
In this paper we present a GB-parsing system for German and in particular the system's strategy for argument interpretation, which copes with the difficulty that word order i...
157
click to vote
COLING
1992
15 years 7 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...