Pages that link to "Item:Q703075"

The following pages link to Optimal time bounds for approximate clustering (Q703075):

Displaying 28 items.

• A lower bound for metric 1-median selection (Q340556) (← links)
• A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
• A \(k\)-median algorithm with running time independent of data size (Q703077) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
• On Las Vegas approximations for metric 1-median selection (Q1739219) (← links)
• Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images (Q1764074) (← links)
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
• Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
• Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
• Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering (Q2384132) (← links)
• Sublinear time approximate clustering (Q2768331) (← links)
• Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Linear-time approximation schemes for clustering problems in any dimensions (Q3578186) (← links)
• A FAST k-MEANS IMPLEMENTATION USING CORESETS (Q3604141) (← links)
• (Q4484257) (← links)
• A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
• Learning Theory (Q4680894) (← links)
• Sublinear-time Algorithms (Q4933363) (← links)
• (Q5417662) (← links)
• Automata, Languages and Programming (Q5466479) (← links)
• (Q5874528) (← links)
• Approximation algorithms for hierarchical location problems (Q5920573) (← links)
• Clustering mixtures with almost optimal separation in polynomial time (Q6083577) (← links)
• Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph (Q6491305) (← links)
• Deterministic metric 1-median selection with very few queries (Q6590087) (← links)