Pages that link to "Item:Q3579227"

The following pages link to Approximate clustering via core-sets (Q3579227):

Displaying 50 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← 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)
• Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
• The maximum vector-angular margin classifier and its fast training on large datasets using a core vector machine (Q456027) (← links)
• Analysis of agglomerative clustering (Q472480) (← links)
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
• Efficient subspace approximation algorithms (Q664540) (← links)
• Improved linear embeddings via Lagrange duality (Q669310) (← links)
• Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
• Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
• Dynamic coresets (Q834605) (← links)
• New algorithms for \(k\)-center and extensions (Q849133) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← 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)
• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• No dimension-independent core-sets for containment under homothetics (Q1942308) (← links)
• The 2-center problem in three dimensions (Q1947989) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
• Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball (Q2088318) (← links)
• Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
• Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
• Parameterized low-rank binary matrix approximation (Q2218414) (← links)
• Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
• Metric \(k\)-median clustering in insertion-only streams (Q2231758) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
• Streaming algorithms for extent problems in high dimensions (Q2345940) (← 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)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation (Q2469731) (← links)
• Optimal core-sets for balls (Q2479470) (← links)
• Frequency-based views to pattern collections (Q2489656) (← links)
• Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
• On the \(k\)-means/median cost function (Q2671798) (← links)
• Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams (Q2971636) (← links)
• Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (Q3012849) (← links)
• Topographic Mapping of Large Dissimilarity Data Sets (Q3164213) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662) (← links)
• Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)