article · 2003

K-selection in hypercubes

Cited by 0Abstract and details only

Abstract

This paper deals with the problem of finding the K smallest elements out of a totally ordered but non sorted set of N elements. This problem, called K-selection, arises often in statistics, image processing and distributed computing. The author's algorithm has a worst-case complexity O(log K(log log K)/sup 2/+log K log log /sup N///sub K/+log /sup N///sub K/) on a hypercube of size N, which is asymptotically optimal when K=(log N)/sup beta /, for any constant beta . This is a great improvement on previous results. The author addresses the universal K-selection problem as well.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

Cite this paper

APA 7

Berthomé, P. (2003). K-selection in hypercubes. https://doi.org/10.1109/icci.1992.227681

MLA 9

Berthomé, Pascal. “K-selection in hypercubes.” 2003, pp. 164–67, https://doi.org/10.1109/icci.1992.227681.

Chicago

Berthomé, Pascal. 2003. “K-selection in hypercubes.” https://doi.org/10.1109/icci.1992.227681.

Harvard

Berthomé, P. (2003) ‘K-selection in hypercubes’. Available at: https://doi.org/10.1109/icci.1992.227681.

BibTeX

@article{berthome2003selection,
  title = {{K-selection in hypercubes}},
  author = {Berthomé, Pascal},
  pages = {164--167},
  year = {2003},
  doi = {10.1109/icci.1992.227681}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.