Search Results for author:
Found 2 papers, 0 papers with code
Fast and Efficient Matching Algorithm with Deadline Instances
But in \textsc{FastPostponedGreedy} algorithm, the status of each node is unknown at first.
A Faster $k$-means++ Algorithm
We propose a new algorithm \textsc{FastKmeans++} that only takes in $\widetilde{O}(nd + nk^2)$ time, in total.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
