168 search results - page 25 / 34 » et 1998 |
ACL
1998
13 years 9 months ago
1998
This paper describes a novel method by which a dialogue agent can learn to choose an optimal dialogue strategy. While it is widely agreed that dialogue strategies should be formul...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disa...
IEEEMM
1998
13 years 7 months ago
1998
ract syntax notation ATM asynchronous transfer mode CCETT Centre Commun d’Etudes de Télédiffusion et Télécommunications Davic Digital Audio Visual Council DSMCC Digital Stora...
JSAC
1998
13 years 7 months ago
1998
—In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...