Sciweavers

2623 search results - page 208 / 525
» Universal Learning Theory
Sort
View
EACL
1989
ACL Anthology
15 years 6 months ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
ALIFE
2002
15 years 4 months ago
"Artificial Societies" and the Social Sciences
nized according to abstract classificatory principles..."5 Adorno's point was that 1 Adorno, T.W., Dahrendorf, R., Pilot, H., Albert, H., Habermas, J. and Popper, K.:The ...
J. Stephen Lansing
148
Voted
RSA
2002
99views more  RSA 2002»
15 years 4 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott
154
Voted
COLT
1993
Springer
15 years 9 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
139
Voted
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 5 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil