Pages that link to "Item:Q2458086"
From MaRDI portal
The following pages link to Parallel computations and committee constructions (Q2458086):
Displaying 3 items.
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms (Q463372) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)