Enumerating Range Modes

07/25/2019
by   Kentaro Sumigawa, et al.
0

We consider the range mode problem where given a sequence and a query range in it, we want to find items with maximum frequency in the range. We give time- and space- efficient algorithms for this problem. Our algorithms are efficient for small maximum frequency cases. We also consider a natural generalization of the problem: the range mode enumeration problem, for which there has been no known efficient algorithms. Our algorithms have query time complexities which is linear to the output size plus small terms.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset