16430 search results - page 143 / 3286 » On Computable Tree Functions |
129
Voted
CG
2010
Springer
15 years 1 months ago
2010
Springer
Monte Carlo Tree Search has given computer go a significant boost in strength the past few years, but progress seems to have slowed, and once again we have to ask ourselves how can...
110
Voted
ACL
2006
15 years 5 months ago
2006
Data-driven grammatical function tag assignment has been studied for English using the Penn-II Treebank data. In this paper we address the question of whether such methods can be ...
133
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
115
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
107
Voted
ACL
2000
15 years 5 months ago
2000
As an application of NLP to computer-assisted language learning(CALL) , we propose a diagnostic processing of Japanese being able to detect errors and inappropriateness of sentenc...