Sciweavers

537 search results - page 8 / 108
» A Call to Regularity
Sort
View
TABLEAUX
2005
Springer
14 years 1 months ago
A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are simi...
Rajeev Goré, Linh Anh Nguyen
ICML
2009
IEEE
14 years 8 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
INTERSPEECH
2010
13 years 2 months ago
Regularized-MLLR speaker adaptation for computer-assisted language learning system
In this paper, we propose a novel speaker adaptation technique, regularized-MLLR, for Computer Assisted Language Learning (CALL) systems. This method uses a linear combination of ...
Dean Luo, Yu Qiao, Nobuaki Minematsu, Yutaka Yamau...
ECCV
2008
Springer
14 years 9 months ago
SERBoost: Semi-supervised Boosting with Expectation Regularization
The application of semi-supervised learning algorithms to large scale vision problems suffers from the bad scaling behavior of most methods. Based on the Expectation Regularization...
Amir Saffari, Helmut Grabner, Horst Bischof
ICGI
2010
Springer
13 years 8 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez