53 search results - page 3 / 11 » On Space Efficient Two Dimensional Range Minimum Data Struct... |
137
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
129
click to vote
CW
2002
IEEE
15 years 8 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
116
click to vote
ADC
2003
Springer
15 years 8 months ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
105
click to vote
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
148
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...