Miniball

swMATH5179MaRDI QIDQ17319

No author found.

Described by source

• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS

Related Items (45)

Integration of expert knowledge into radial basis function surrogate models ⋮ An efficient cutting plane algorithm for the smallest enclosing circle problem ⋮ The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ An efficient algorithm for the smallest enclosing ball problem in high dimensions ⋮ A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) ⋮ A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ Unnamed Item ⋮ Collision detection for deforming necklaces ⋮ Protein structure optimization by side-chain positioning via beta-complex ⋮ A new approach for the computation of halfspace depth in high dimensions ⋮ A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) ⋮ A quasi-Monte Carlo method for computing areas of point-sampled surfaces ⋮ Penalty-based aggregation of multidimensional data ⋮ On the string consensus problem and the Manhattan sequence consensus problem ⋮ Counting unique-sink orientations ⋮ Random sampling with removal ⋮ Combinatorial generalizations of Jung's theorem ⋮ Image‐Based Surface Compression ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ Čech-Delaunay gradient flow and homology inference for self-maps ⋮ Unique sink orientations of grids ⋮ Using machine learning for model benchmarking and forecasting of depletion-induced seismicity in the Groningen gas field ⋮ Algorithms for determining relative position between spheroids and hyperboloids with one sheet ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ A simple sampling lemma: Analysis and applications in geometric optimization ⋮ Efficient algorithms for the smallest enclosing ball problem ⋮ Surface area estimation of digitized 3D objects using quasi-Monte Carlo methods ⋮ On a minimum enclosing ball of a collection of linear subspaces ⋮ Unnamed Item ⋮ SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ Covering convex polygons by two congruent disks ⋮ Solving quadratic programs to high precision using scaled iterative refinement ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Solving \(k\)-center problems involving sets based on optimization techniques ⋮ Fast estimation of the shear stress amplitude for fatigue life analysis of metals ⋮ Chebyshev centres, Jung constants, and their applications ⋮ Algorithms - ESA 2003 ⋮ Two Algorithms for the Minimum Enclosing Ball Problem ⋮ APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING ⋮ Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball ⋮ Covering convex polygons by two congruent disks ⋮ Approximating persistent homology in Euclidean space through collapses

This page was built for software: Miniball