21 search results - page 2 / 5 » Optimal Succinctness for Range Minimum Queries |
DCC
2010
IEEE
14 years 10 days 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...
CPM
2007
Springer
13 years 11 months ago
2007
Springer
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
TKDE
2011
13 years 12 days ago
2011
—With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PD...
ISAAC
2009
Springer
14 years 1 days 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 ...