Parallel computations and committee constructions

DOI10.1134/S0005117907050165zbMath1169.68576OpenAlexW1994890878MaRDI QIDQ2458086

Vl. D. Mazurov, Mikhail Yu. Khachay

Publication date: 31 October 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117907050165

zbMATH Keywords

laminated neural networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (3)

Committee polyhedral separability: complexity and polynomial approximation ⋮ Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules ⋮ Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms

Cites Work

• Computational complexity of the minimum committee problem and related problems
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• The hardness of 3-uniform hypergraph coloring
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel computations and committee constructions