Sciweavers

6 search results - page 2 / 2
» COFFIN: A Computational Framework for Linear SVMs
Sort
View
MLG
2007
Springer
13 years 11 months ago
A Universal Kernel for Learning Regular Languages
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...
Leonid Kontorovich