The following pages link to Vera Kurková (Q213310):
Displaying 46 items.
- (Q433293) (redirect page) (← links)
- Accuracy of approximations of solutions to Fredholm equations by kernel methods (Q433295) (← links)
- 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)
- Approximative compactness of linear combinations of characteristic functions (Q783713) (← links)
- (Q889279) (redirect page) (← links)
- Comparing fixed and variable-width Gaussian networks (Q889280) (← links)
- Complexity of Gaussian-radial-basis networks approximating smooth functions (Q998978) (← links)
- Best approximation by linear combinations of characteristic functions of half-spaces. (Q1395802) (← links)
- Geometry and topology of continuous best and near best approximations (Q1583970) (← links)
- (Q1921159) (redirect page) (← links)
- Singularities of finite scaling functions (Q1921161) (← 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)
- Correlations of random classifiers on large data sets (Q2100403) (← links)
- Probabilistic lower bounds for approximation by shallow perceptron networks (Q2181058) (← links)
- Quasiorthogonal dimension (Q2215935) (← links)
- Integral transforms induced by heaviside perceptrons (Q2215936) (← links)
- Quasiorthogonal dimension of Euclidean spaces (Q2367970) (← links)
- Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets (Q2381815) (← links)
- Rates of minimization of error functionals over Boolean variable-basis functions (Q2583503) (← links)
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves (Q2643849) (← links)
- Complexity of Shallow Networks Representing Finite Mappings (Q2814145) (← links)
- Approximate Minimization of the Regularized Expected Error over Kernel Models (Q3168992) (← links)
- An Integral Upper Bound for Neural Network Approximation (Q3399370) (← links)
- (Q3483506) (← links)
- Minimization of Error Functionals over Perceptron Networks (Q3539962) (← links)
- Integral combinations of Heavisides (Q3567445) (← links)
- Geometric Upper Bounds on Rates of Variable-Basis Approximation (Q3604968) (← links)
- Cardinal Functions on Modifications of Uniform Spaces and Fine Uniform Spaces (Q3946779) (← links)
- (Q4319547) (← links)
- (Q4400833) (← links)
- Bounds on rates of variable-basis and neural-network approximation (Q4544714) (← links)
- Comparison of worst case errors in linear and neural network approximation (Q4544781) (← links)
- (Q4546512) (← links)
- Minimization of Error Functionals over Variable-Basis Functions (Q4651966) (← links)
- (Q4783893) (← links)
- (Q4897527) (← links)
- Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks (Q5272131) (← links)
- Error Estimates for Approximate Optimization by the Extended Ritz Method (Q5317507) (← links)
- Geometric Rates of Approximation by Neural Networks (Q5448680) (← links)
- Estimates of Data Complexity in Neural-Network Learning (Q5448788) (← links)
- Neural Network Learning as an Inverse Problem (Q5716212) (← links)
- Continuity of approximation by neural networks in \(L_p\) spaces (Q5948174) (← links)
- Approximation of classifiers by deep perceptron networks (Q6488832) (← links)
