6715 search results - page 986 / 1343 » Learning from a Test Set |
177
click to vote
NAACL
2004
15 years 8 months ago
2004
We present a technique for augmenting annotated training data with hierarchical word clusters that are automatically derived from a large unannotated corpus. Cluster membership is...
190
click to vote
NIPS
2001
15 years 8 months ago
2001
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
165
click to vote
NIPS
2003
15 years 8 months ago
2003
Super-resolution aims to produce a high-resolution image from a set of one or more low-resolution images by recovering or inventing plausible high-frequency image content. Typical...
179
click to vote
ACL
1998
15 years 8 months ago
1998
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
191
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...