Algorithms - ESA 2003
From MaRDI portal
(Redirected from Publication:5897282)
Algorithms - ESA 2003 (scientific article; zbMATH DE number 5677162)
Algorithms - ESA 2003 (scientific article; zbMATH DE number 5677162)
Recommendations
- scientific article; zbMATH DE number 1985309
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- Approximate minimum enclosing balls in high dimensions using core-sets
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Efficient algorithms for the smallest enclosing ball problem
- A fast deterministic smallest enclosing disk approximation algorithm
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Algorithms - ESA 2003
Cited in
(31)- On the string consensus problem and the Manhattan sequence consensus problem
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Efficient algorithms for the smallest enclosing ball problem
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Fast estimation of the shear stress amplitude for fatigue life analysis of metals
- The nearest polynomial to multiple given polynomials with a given zero in the real case
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- Finding the homology of submanifolds with high confidence from random samples
- Reconstructing functions from random samples
- Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable?
- A hybrid algorithm for the minimum bounding sphere problem
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Optimization algorithms for faster computational geometry
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- Distance between the fractional Brownian motion and the space of adapted Gaussian martingales
- Minimal containment under homothetics: a simple cutting plane approach
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- Approximate minimum enclosing balls in high dimensions using core-sets
- scientific article; zbMATH DE number 7651177 (Why is no real title available?)
- Algorithms - ESA 2003
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
- A faster dual algorithm for the Euclidean minimum covering ball problem
- A note on the support vector data description problem
- On approximating the Riemannian 1-center
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
This page was built for publication: Algorithms - ESA 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897282)
