The densest hemisphere problem
From MaRDI portal
Publication:1242681
DOI10.1016/0304-3975(78)90006-3zbMath0368.68053OpenAlexW2053113791MaRDI QIDQ1242681
Franco P. Preparata, David S. Johnson
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/74081
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Related Items
Deep learning: a statistical viewpoint, Approximate computation of projection depths, Some connections between learning and optimization, Optimal length resolution refutations of difference constraint systems, The hardness of approximate optima in lattices, codes, and systems of linear equations, Matrix sparsification and the sparse null space problem, On geometric optimization with few violated constraints, The complexity and approximability of finding maximum feasible subsystems of linear relations, Exact computation of the halfspace depth, Best subset binary prediction, Analysis and test of efficient methods for building recursive deterministic perceptron neural networks, Novel approaches to the discrimination problem, Efficient MIP techniques for computing the relaxation complexity, Robust fitting in computer vision: easy or hard?, Solving some vector subset problems by Voronoi diagrams, Computational aspects of relaxation complexity: possibilities and limitations, Uniform convergence rates for the approximated halfspace and projection depth, An exact algorithm for finding a vector subset with the longest sum, Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning, On the computational complexity of the minimum committee problem, Robust Estimators in High-Dimensions Without the Computational Intractability, A two-phase relaxation-based heuristic for the maximum feasible subsystem problem, Concentration of the empirical level sets of Tukey's halfspace depth, Robust arbitrage conditions for financial markets, A centrality notion for graphs based on Tukey depth, A polynomial-time algorithm for computing the yolk in fixed dimension, The complexity of linear programming, The instability of instability of centered distributions, Training a Single Sigmoidal Neuron Is Hard, A local Vapnik-Chervonenkis complexity, On the Nonlearnability of a Single Spiking Neuron, Tractable algorithms for robust model estimation, Discussion, Theory of Classification: a Survey of Some Recent Advances, Generating all vertices of a polyhedron is hard, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, The computational complexity of densest region detection
Cites Work
