3006 search results - page 131 / 602 » Dimensionality reduction and generalization |
144
Voted
FSTTCS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
127
Voted
TCS
1998
15 years 3 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
86
Voted
MOC
2002
15 years 3 months ago
2002
In a series of papers, B. C. Carlson produced tables of elliptic integrals, evaluating them in terms of easily computed symmetrical functions, using a group of multivariate recurre...
108
click to vote
APLAS
2009
ACM
15 years 8 months ago
2009
ACM
We study the resource calculus – the non-lazy version of Boudol’s λ-calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to ...
128
Voted
IJCNN
2000
IEEE
15 years 8 months ago
2000
IEEE
The problem of designing input signals for optimal generalization in supervised learning is called active learning. In many active learning methods devised so far, the bias of the...