Uniformization of discrete data

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Some kind of discrete data sets can be practically transformed into uniform by the related distribution function. By addressing the sparsity of data which measures the discreteness, this paper demonstrates that the sparsity decides the uniformity of the transformed data, and that could be a good reason to explain both the success of the bucket sort in PennySort 2003 and the failure for the same algorithm with the data modified. So the sparsity provides a good criterion to predict whether the algorithm works or not. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Yang, L. (2005). Uniformization of discrete data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 453–462). Springer Verlag. https://doi.org/10.1007/11602613_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free