Sciweavers

1343 search results - page 23 / 269
» Learning to Complete Sentences
Sort
View
ACL
2012
13 years 9 months ago
Joint Learning of a Dual SMT System for Paraphrase Generation
SMT has been used in paraphrase generation by translating a source sentence into another (pivot) language and then back into the source. The resulting sentences can be used as can...
Hong Sun, Ming Zhou
ICASSP
2011
IEEE
14 years 10 months ago
Low-rank matrix completion by variational sparse Bayesian learning
There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating th...
S. Derin Babacan, Martin Luessi, Rafael Molina, Ag...
CLOR
2006
15 years 10 months ago
A Sparse Object Category Model for Efficient Learning and Complete Recognition
We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a weakly-supervised manner: the model is learnt from examp...
Robert Fergus, Pietro Perona, Andrew Zisserman
TKDE
2010
168views more  TKDE 2010»
15 years 4 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
ICML
2007
IEEE
16 years 7 months ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto