Pages that link to "Item:Q703077"

The following pages link to A \(k\)-median algorithm with running time independent of data size (Q703077):

Displaying 12 items.

• Optimal time bounds for approximate clustering (Q703075) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
• Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
• Clustering with or without the approximation (Q2377383) (← links)
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering (Q2384132) (← links)
• A new efficient algorithm based on DC programming and DCA for clustering (Q2385500) (← links)
• Mathematical Programming Formulations and Algorithms for Discrete <i>k</i>-Median Clustering of Time-Series Data (Q2967621) (← links)
• Learning Theory (Q4680894) (← links)
• Sublinear-time Algorithms (Q4933363) (← links)
• Automata, Languages and Programming (Q5716761) (← links)
• (Q5874507) (← links)