Pages that link to "Item:Q1119020"
From MaRDI portal
The following pages link to On the complexity of polyhedral separability (Q1119020):
Displayed 21 items.
- Combinatorial characterizations of \(K\)-matrices (Q609481) (← links)
- Combinatorial optimization problems related to the committee polyhedral separability of finite sets (Q735652) (← 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)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← 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)
- Training a Single Sigmoidal Neuron Is Hard (Q4409384) (← links)
- Separation via polyhedral conic functions (Q5481682) (← links)
- Polyhedral separability through successive LP (Q5959910) (← links)