On the average number of maximal in a set of vectors
From MaRDI portal
Publication:1824385
DOI10.1016/0020-0190(89)90156-7zbMath0682.68041OpenAlexW1968246336MaRDI QIDQ1824385
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90156-7
probabilistic analysis of algorithmsrandom pointsgeometric probabilityaverage number of maximamaxima of a set of vectors
Related Items (max. 100)
A provably fast linear-expected-time maxima-finding algorithm ⋮ How many maxima can there be? ⋮ Records, the maximal layer, and uniform distributions in monotone sets ⋮ The restrictiveness of the hazard rate order and the moments of the maximal coordinate of a random vector uniformly distributed on the probability \(n\)-simplex ⋮ On random cartesian trees ⋮ Towards estimating expected sizes of probabilistic skylines ⋮ K-dominance in multidimensional data: theory and applications ⋮ Unnamed Item ⋮ Effective space usage estimation for sliding-window skybands ⋮ Exact asymptotics of divide-and-conquer recurrences ⋮ Mellin transforms and asymptotics: Finite differences and Rice's integrals ⋮ Bounding the expected number of rectilinear full Steiner trees ⋮ Dominant skyline query processing over multiple time series ⋮ On some combinatorial identities and harmonic sums ⋮ Sampling-based approximate skyline calculation on big data ⋮ K-Dominance in Multidimensional Data: Theory and Applications ⋮ On the variance of the number of maxima in random vectors and its applications ⋮ Analytic variations on quadtrees
Cites Work
This page was built for publication: On the average number of maximal in a set of vectors
