Sciweavers

10 search results - page 2 / 2
» The Theory of Stabilisation Monoids and Regular Cost Functio...
Sort
View
LATA
2010
Springer
15 years 4 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
ESANN
2004
14 years 11 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
A new understanding of prediction markets via no-regret learning
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
Yiling Chen, Jennifer Wortman Vaughan
TMI
2008
171views more  TMI 2008»
14 years 9 months ago
Fluid Registration of Diffusion Tensor Images Using Information Theory
We apply an information-theoretic cost metric, the symmetrized Kullback-Leibler (sKL) divergence, or -divergence, to fluid registration of diffusion tensor images. The difference b...
Ming-Chang Chiang, Alex D. Leow, Andrea D. Klunder...
82
Voted
INFORMATIKTAGE
2008
14 years 11 months ago
Constraint Based Transformation Theory
During the last 25 years the complexity and functionality of software systems has increased dramatically. Software systems have to be updated and restructured continuously [22]. I...
Stefan Natelberg