DocumentCode
3756538
Title
An Efficient Solution for the Generalized Median Problem
Author
Daxin Zhu;Xiaodong Wang
Author_Institution
Quanzhou Normal Univ., Quanzhou, China
fYear
2015
Firstpage
89
Lastpage
94
Abstract
A generalized median finding problem is studied in this paper. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size T(log n). Our data structure is a practical linear space data structure that supports range selection queries in O(log n) time with O(n log n) preprocessing time.
Keywords
"Arrays","Indexes","Algorithm design and analysis","Computational modeling","Binary trees","Random access memory"
Publisher
ieee
Conference_Titel
Computational Science and Computational Intelligence (CSCI), 2015 International Conference on
Type
conf
DOI
10.1109/CSCI.2015.8
Filename
7424069
Link To Document