The following pages link to (Q4471374):
Displaying 36 items.
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (Q390131) (← links)
- Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
- A stochastic algorithm finding generalized means on compact manifolds (Q404139) (← links)
- Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography (Q508673) (← links)
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training (Q508681) (← links)
- Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
- On approximating the Riemannian 1-center (Q714906) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- Riemannian \(L^p\) averaging on Lie group of nonzero quaternions (Q742343) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- Dynamic coresets (Q834605) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- No dimension-independent core-sets for containment under homothetics (Q1942308) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- On a minimum enclosing ball of a collection of linear subspaces (Q2032259) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems (Q2377164) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Optimal core-sets for balls (Q2479470) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls (Q2948466) (← links)
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (Q3012849) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- Averaging Symmetric Positive-Definite Matrices (Q3300555) (← links)
- Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices (Q4967762) (← links)
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
- Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465864) (← links)
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries (Q5883715) (← links)
- Analysis of incomplete data and an intrinsic-dimension Helly theorem (Q5901492) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
- On coresets for support vector machines (Q5919115) (← links)
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)
- Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)
