Sciweavers

44 search results - page 7 / 9
» On updates that constrain the features' connections during l...
Sort
View
JAIR
2006
137views more  JAIR 2006»
13 years 7 months ago
Learning Sentence-internal Temporal Relations
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
Maria Lapata, Alex Lascarides
CSEE
2011
Springer
12 years 11 months ago
Pex4Fun: Teaching and learning computer science via social gaming
Pex4Fun (http://www.pexforfun.com/)from Microsoft Research is a web-based serious gaming environment for teaching computer science. Pex4Fun can be used to teach and learn computer...
Nikolai Tillmann, Jonathan de Halleux, Tao Xie
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
ICML
2008
IEEE
14 years 8 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
CVPR
2003
IEEE
14 years 9 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath