25 search results - page 2 / 5 » Linear-Space Data Structures for Range Mode Query in Arrays |
ESA
2010
Springer
13 years 4 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
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...