4591 search results - page 745 / 919 » Learning from Dyadic Data |
149
click to vote
NIPS
2001
15 years 5 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...
122
click to vote
NIPS
2003
15 years 5 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...
158
click to vote
ANLP
2000
15 years 5 months ago
2000
This paper describes experiments to establish the performance of a named entity recognition system which builds categorized lists of names from manually annotated training data. N...
130
click to vote
SIGCSE
2010
ACM
15 years 4 months ago
2010
ACM
An analysis of data from 259 CS1 students is performed to compare the performance of students who were paired by demonstrated ability to that of students who were paired randomly ...
130
click to vote
COLING
2002
15 years 3 months ago
2002
Text representation is a central task for any approach to automatic learning from texts. It requires a format which allows to interrelate texts even if they do not share content w...