CORR
2010
Springer
12 years 11 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
ESA
2003
Springer
13 years 9 months ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...