Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Related topics

Related topics

1 relation
Data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On Approximate Range Mode and Range Selection
For any $\epsilon \in (0,1)$, a $(1+\epsilon)$-approximate range mode query asks for the position of an element whose frequency… 
2019
2019
Range Mode Query and Solution Enumeration
2018
2018
Space Efficient Data Structures and Algorithms in the Word-RAM Model
In this thesis we study space-efficient data structures for various combinatorial objects. We focus on succinct and compact data… 
2015
2015
Low Space Data Structures for Geometric Range Mode Query
2011
2011
Linear-Space Data Structures for Range Mode Query in Arrays
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… 
2010
2010
Cell Probe Lower Bounds and Approximations for Range Mode
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… 
2005
2005
Approximate Range Mode and Range Median Queries
We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)