474
click to vote
ALT
9 years 10 months ago
2015 Springer
Abstract. We introduce a broad learning model formed by cascades of predictors, Deep Cascades, that is structured as general decision trees in which leaf predictors or node questio...
465
click to vote
ALT
9 years 10 months ago
2015 Springer
Weighted automata (WFAs) provide a general framework for the representation of functions mapping strings to real numbers. They include as special instances deterministic finite au...
436
click to vote
ALT
9 years 10 months ago
2015 Springer
Abstract. We compose a toolbox for the design of Minimum Disagreement algorithms. This box contains general procedures which transform (without much loss of efficiency) algorithms ...
389
click to vote
ALT
9 years 10 months ago
2015 Springer
We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin c...
386
click to vote
ALT
9 years 10 months ago
2015 Springer
Deterministic finite automata (DFA) have long served as a fundamental computational model in the study of theoretical computer science, and the problem of learning a DFA from give...
|