Sciweavers

2576 search results - page 213 / 516
» The Complexity of Zero Knowledge
Sort
View
EACL
2006
ACL Anthology
15 years 8 months ago
Example-Based Metonymy Recognition for Proper Nouns
Metonymy recognition is generally approached with complex algorithms that rely heavily on the manual annotation of training and test data. This paper will relieve this complexity ...
Yves Peirsman
FLAIRS
2001
15 years 8 months ago
User-Agent Interactions in Mixed-Initiative Learning
Mixed-initiative learning integrates complementary human and automated reasoning, taking advantage of their respective reasoning styles and computational strengths in order to sol...
Dorin Marcu, Mihai Boicu, Gheorghe Tecuci
EJC
2000
15 years 8 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
AAAI
1996
15 years 8 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang
ACL
1992
15 years 7 months ago
Modeling Negotiation Subdialogues
This paper presents a plan-based model that handles negotiation subdialogues by inferring both the communicative actions that people pursue when speaking and the beliefs underlyin...
Lynn Lambert, Sandra Carberry