Cited by 8
Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position

Committee polyhedral separability: complexity and polynomial approximation
Michael Khachay
Journal  Machine Learning Volume 101, Issue 1-3 (2015), p. 231
Committees: History and Applications in Machine Learning
Vladimir D. Mazurov, Ekaterina Yu. Polyakova
Book  Communications in Computer and Information Science (Mathematical Optimization Theory and Operations Research) Volume 1090 (2019), p. 3
Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
M. Yu. Khachai
Journal  Proceedings of the Steklov Institute of Mathematics Volume 272, Issue S1 (2011), p. 46
Computational complexity of combinatorial problems related to piecewise linear committee pattern-recognition learning procedures
M. Yu. Khachai, M. I. Poberii
Journal  Pattern Recognition and Image Analysis Volume 22, Issue 2 (2012), p. 278
Constraint elimination method for the committee problem
K. S. Kobylkin
Journal  Automation and Remote Control Volume 73, Issue 2 (2012), p. 355
Hitting Set Problem for Axis-Parallel Squares Intersecting a Straight Line Is Polynomially Solvable for Any Fixed Range of Square Sizes
Daniel Khachay, Michael Khachay, Maria Poberiy
Book  Lecture Notes in Computer Science (Analysis of Images, Social Networks and Texts) Volume 10716 (2018), p. 334
Lower bounds for the number of hyperplanes separating two finite sets of points
K. S. Kobylkin
Journal  Proceedings of the Steklov Institute of Mathematics Volume 289, Issue S1 (2015), p. 126
Ural School of Pattern Recognition: Majoritarian Approach to Ensemble Learning
Vl. D. Mazurov, M. I. Poberii, M. Yu. Khachai
Journal  Pattern Recognition and Image Analysis Volume 33, Issue 4 (2023), p. 1458