The following pages link to (Q2768331):
Displaying 9 items.
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering (Q2384132) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- (Q5874507) (← links)
