17129 search results - page 3006 / 3426 » Applied Computing |
190
click to vote
ACL
1998
15 years 8 months ago
1998
Word sense disambiguation for unrestricted text is one of the most difficult tasks in the fields of computational linguistics. The crux of the problem is to discover a model that ...
170
click to vote
AIPS
2000
15 years 8 months ago
2000
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
193
click to vote
ACL
1998
15 years 8 months ago
1998
For the task of recognizing dialogue acts, we are applying the Transformation-Based Learning (TBL) machine learning algorithm. To circumvent a sparse data problem, we extract valu...
179
click to vote
UAI
2003
15 years 8 months ago
2003
ontingent abstraction for robust robot control Joelle Pineau, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 This pape...
179
click to vote
FTCS
1998
15 years 8 months ago
1998
Ensuring the correctness of computer systems used in lifecritical applications is very difficult. The most commonly used verification methods, simulation and testing, are not exha...