You are currently offline. Some features of the site may not work correctly.

# Range mode query

Known as: Range mode queries
In data structures, the range mode query problem asks to build a data structure on some input data to efficiently answer queries asking for the mode… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• ISAAC
• 2019
• Corpus ID: 197935219
For any $\epsilon \in (0,1)$, a $(1+\epsilon)$-approximate range mode query asks for the position of an element whose frequency… Expand
Is this relevant?
2019
2019
• 2019
• Corpus ID: 88497053

Is this relevant?
2018
2018
In this thesis we study space-efficient data structures for various combinatorial objects. We focus on succinct and compact data… Expand
Is this relevant?
2014
2014
• CCCG
• 2014
• Corpus ID: 397094
Let S be a set of n points in d dimensions such that each point is assigned a color. Given a query range Q = a 1 , b 1 ] i? a 2… Expand
Is this relevant?
2013
2013
• Theory of Computing Systems
• 2013
• Corpus ID: 3052753
A mode of a multiset S is an element a∈S of maximum multiplicity; that is, a occurs at least as frequently as any other element… Expand
Is this relevant?
2013
2013
• MFCS
• 2013
• Corpus ID: 39263885
We present O(n)-space data structures to support various range frequency queries on a given array A[0:n − 1] or tree T with n… Expand
Is this relevant?
2012
2012
• STACS
• 2012
• Corpus ID: 30702875

Is this relevant?
2010
2010
• ICALP
• 2010
• Corpus ID: 17927743
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… Expand
Is this relevant?
2005
2005
• STACS
• 2005
• Corpus ID: 13523199
We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j… Expand
Is this relevant?