The following pages link to The densest hemisphere problem (Q1242681):
Displaying 37 items.
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning (Q643804) (← links)
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- Approximate computation of projection depths (Q830503) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- On the computational complexity of the minimum committee problem (Q928677) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- The computational complexity of densest region detection (Q1604217) (← links)
- Exact computation of the halfspace depth (Q1659242) (← links)
- Best subset binary prediction (Q1668571) (← links)
- Concentration of the empirical level sets of Tukey's halfspace depth (Q1740596) (← links)
- Tractable algorithms for robust model estimation (Q1799942) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Analysis and test of efficient methods for building recursive deterministic perceptron neural networks (Q1931966) (← links)
- Robust arbitrage conditions for financial markets (Q1981932) (← links)
- Robust fitting in computer vision: easy or hard? (Q2193856) (← links)
- Uniform convergence rates for the approximated halfspace and projection depth (Q2209837) (← links)
- A centrality notion for graphs based on Tukey depth (Q2244178) (← links)
- The instability of instability of centered distributions (Q2270335) (← links)
- A local Vapnik-Chervonenkis complexity (Q2281678) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- On the Nonlearnability of a Single Spiking Neuron (Q3370746) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Novel approaches to the discrimination problem (Q4031377) (← links)
- Training a Single Sigmoidal Neuron Is Hard (Q4409384) (← links)
- Robust Estimators in High-Dimensions Without the Computational Intractability (Q4634036) (← links)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
- Deep learning: a statistical viewpoint (Q5887827) (← links)
- The complexity of linear programming (Q5904560) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Discussion (Q5971125) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
