10 search results - page 1 / 2 » Range Mode and Range Median Queries on Lists and Trees |
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
MICS
2010
13 years 3 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
SPIRE
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...