License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2018.63
URN: urn:nbn:de:0030-drops-100111
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/10011/
Cheng, Siu-Wing ;
Yan, Lie
Extensions of Self-Improving Sorters
Abstract
Ailon et al. (SICOMP 2011) proposed a self-improving sorter that tunes its performance to the unknown input distribution in a training phase. The distribution of the input numbers x_1,x_2,...,x_n must be of the product type, that is, each x_i is drawn independently from an arbitrary distribution D_i, and the D_i's are independent of each other. We study two extensions that relax this requirement. The first extension models hidden classes in the input. We consider the case that numbers in the same class are governed by linear functions of the same hidden random parameter. The second extension considers a hidden mixture of product distributions.
BibTeX - Entry
@InProceedings{cheng_et_al:LIPIcs:2018:10011,
author = {Siu-Wing Cheng and Lie Yan},
title = {{Extensions of Self-Improving Sorters}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {63:1--63:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/10011},
URN = {urn:nbn:de:0030-drops-100111},
doi = {10.4230/LIPIcs.ISAAC.2018.63},
annote = {Keywords: sorting, self-improving algorithms, entropy}
}
|
Keywords: |
|
sorting, self-improving algorithms, entropy |
|
Collection: |
|
29th International Symposium on Algorithms and Computation (ISAAC 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
06.12.2018 |
