5771 search results - page 305 / 1155 » Learning similarity space |
197
click to vote
NIPS
1996
15 years 8 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
149
click to vote
MLG
2007
Springer
16 years 26 days ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
183
click to vote
TCS
2008
15 years 6 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
135
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
216
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...