Sciweavers

9 search results - page 1 / 2
» Linear-Space Data Structures for Range Frequency Queries on ...
Sort
View
STACS
2012
Springer
12 years 17 days ago
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 in S. Given an array A[1 : n] of n elements, we...
Timothy M. Chan, Stephane Durocher, Kasper Green L...
MICS
2010
137views more  MICS 2010»
13 years 3 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
ICALP
2010
Springer
13 years 9 months ago
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 problem is an array A of size n. A range query [i, j] mus...
Mark Greve, Allan Grønlund Jørgensen...
FOCS
2009
IEEE
13 years 9 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Online Sorted Range Reporting
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 ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...