502 search results - page 21 / 101 » Learning from General Label Constraints |
NIPS
2003
13 years 10 months ago
2003
We describe a nonparametric Bayesian approach to generalizing from few labeled examples, guided by a larger set of unlabeled objects and the assumption of a latent tree-structure ...
TNN
1998
13 years 8 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
AINA
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the problem of content extraction from online news webpages. To explore to what extent the syntactic markup and the visual structure of a webpage facilitate the extrac...
NAACL
2010
13 years 6 months ago
2010
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...