Pages that link to "Item:Q5463443"

The following pages link to Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443):

Displaying 27 items.

• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (Q390131) (← links)
• Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
• Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
• New algorithms for \(k\)-center and extensions (Q849133) (← links)
• Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
• On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
• On a minimum enclosing ball of a collection of linear subspaces (Q2032259) (← links)
• A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
• Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
• A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
• Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← 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)
• Multi-view L2-SVM and its multi-view core vector machine (Q2418112) (← links)
• Scalable learning method for feedforward neural networks using minimal-enclosing-ball approximation (Q2418176) (← links)
• FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation (Q2469731) (← links)
• Optimal core-sets for balls (Q2479470) (← links)
• Computing minimum-volume enclosing axis-aligned ellipsoids (Q2481119) (← links)
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
• (Q4633010) (← links)
• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
• (Q5874507) (← 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)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)