A note on ranking k maximum sums
2005
In this paper, we design a fast algorithm for ranking the k maximum sum subsequences. Given a sequence of real numbers and an integer parameter k, the problem is to compute k subsequences of consec ...
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
6
References
8
Citations
NaN
KQI