摘要：
A simple greedy construction procedure: - Fill out the seq of 'I' with 0, 1, 2, 3... - Similarly, for the seq of 'D', fill it out with n, n - 1, n - 2 阅读全文
Tony's LogAlgorithms, Distributed System, Machine Learning |