The following pages link to (Q4400833):
Displaying 8 items.
- Can dictionary-based computational models outperform the best linear ones? (Q456017) (← links)
- Some comparisons of complexity in dictionary-based and linear computational models (Q553254) (← links)
- Learning with generalization capability by kernel methods of bounded complexity (Q558012) (← links)
- Complexity of Gaussian-radial-basis networks approximating smooth functions (Q998978) (← links)
- Complexity estimates based on integral transforms induced by computational units (Q1941596) (← links)
- Some implications of interval approach to dimension for network complexity (Q2093971) (← links)
- Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets (Q2381815) (← links)
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves (Q2643849) (← links)
