1667 search results - page 116 / 334 » Extended clause learning |
130
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
140
Voted
FUIN
2008
15 years 4 months ago
2008
Abstract. This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studi...
128
click to vote
JALC
2007
15 years 4 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
106
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
116
click to vote
ACL
2009
15 years 2 months ago
2009
Data-driven function tag assignment has been studied for English using Penn Treebank data. In this paper, we address the question of whether such method can be applied to other la...