6 citations · 6 across the 1 of their papers we have counts for
1 paper
Kohei Miyamoto, Masakazu Iwamura, Koichi Kise
We propose a new finding k-minima algorithm and prove that its query complexity is O(kN), where N is the number of data indices. Though the complexity is equ…