845 search results - page 52 / 169 » Complexity Dimensions and Learnability |
127
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
90
Voted
APPML
2007
15 years 25 days ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
102
click to vote
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
105
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...