158 search results - page 1 / 32 » Approximate Range Mode and Range Median Queries |
68
Voted
STACS
2005
Springer
15 years 3 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...
ISAAC
2003
Springer
15 years 2 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...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
MICS
2010
14 years 8 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...
106
click to vote
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...