39 search results - page 1 / 8 » Range Medians |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
IWPEC
2010
Springer
13 years 3 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...