814 search results - page 135 / 163 » Machine Translation by Case Generalization |
127
Voted
ICML
2000
IEEE
16 years 4 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
134
click to vote
ALT
2005
Springer
16 years 7 days ago
2005
Springer
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced...
121
click to vote
COLT
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
160
click to vote
COLT
1993
Springer
15 years 7 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
133
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...