Skip to search formSkip to main contentSkip to account menu
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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
For any $\epsilon \in (0,1)$, a $(1+\epsilon)$-approximate range mode query asks for the position of an element whose frequency… 
  • table 1
  • table 2
2018
2018
In this thesis we study space-efficient data structures for various combinatorial objects. We focus on succinct and compact data… 
  • figure 4.2
  • figure 4.5
  • figure 4.6
  • figure 4.7
  • figure 4.8
2014
2014
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… 
2013
2013
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… 
  • figure 1
2013
2013
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… 
2010
2010
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… 
  • figure 1
2005
2005
We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j… 
  • figure 1
  • table 1
  • table 2
  • figure 2