Pages that link to "Item:Q1119020"

The following pages link to On the complexity of polyhedral separability (Q1119020):

Displaying 40 items.

• On the problem polyhedral separability: a numerical solution (Q268664) (← links)
• Supervised classification and mathematical optimization (Q339559) (← links)
• Lower bounds for the number of hyperplanes separating two finite sets of points (Q492284) (← links)
• Combinatorial characterizations of \(K\)-matrices (Q609481) (← links)
• Combinatorial optimization problems related to the committee polyhedral separability of finite sets (Q735652) (← links)
• Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
• On learning a union of half spaces (Q915490) (← links)
• Nonlinear separation of data via mixed 0-1 integer and linear programming (Q990586) (← links)
• Approximation algorithms for hitting objects with straight lines (Q1173978) (← links)
• Bilinear separation of two sets in \(n\)-space (Q1315445) (← links)
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
• Hardness results for neural network approximation problems (Q1603592) (← links)
• The computational complexity of densest region detection (Q1604217) (← links)
• Hybrid extreme point tabu search (Q1609924) (← links)
• Separation and approximation of polyhedral objects (Q1900992) (← links)
• Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
• Computational aspects of relaxation complexity (Q2061898) (← links)
• Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
• Geometric separability using orthogonal objects (Q2122791) (← links)
• A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
• Complexity of linear relaxations in integer programming (Q2149550) (← links)
• Support vector machine polyhedral separability in semisupervised learning (Q2342142) (← links)
• Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
• Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
• About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
• A LAD-based method for selecting short oligo probes for genotyping applications (Q2481571) (← links)
• A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
• On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
• On the complexity of some geometric problems in unbounded dimension (Q2638782) (← links)
• Complexity of training ReLU neural network (Q2673242) (← links)
• Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
• Training a Single Sigmoidal Neuron Is Hard (Q4409384) (← links)
• Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
• On the complexity of approximating and illuminating three-dimensional convex polyhedra (Q5057423) (← links)
• On the Parameterized Complexity of Red-Blue Points Separation (Q5111867) (← links)
• Separation via polyhedral conic functions (Q5481682) (← links)
• Polyhedral separability through successive LP (Q5959910) (← links)
• Monochromatic partitioning of colored points by lines (Q6161462) (← links)
• A classification method based on a cloud of spheres (Q6491344) (← links)