On the Average Number of Maxima in a Set of Vectors and Applications

Abstract

ABSTRACT.A maximal vector of a set ~s one which is not less than any other vector m all components We derive a recurrence relation for computing the average number of maxunal vectors m a set of n vectors m d-space under the assumpUon that all (nl) a relative ordermgs are equally probable. Solving the recurrence shows that the average number of maxmaa is O((ln n) a-~) for fixed d We use this result to construct an algorithm for finding all the maxima that have expected running tmae hnear m n (for sets of vectors drawn under our assumptions) We then use the result to find an upper bound on the expected number of convex hull points m a random point set KE~ WORDS AND eHRASES maxtma of a set of vectors, average number of maxtma, expected-tsme algorithms, analysts of algorithms, convex hulls, dynamtc programming CR CATEGORIES" 5 25, 5.39, 5.42

Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval

“…Otherwise, is split into two sets 1 and 2 and the algorithm applies itself recursively on both of them. The two results 1 and 2 are subsequently cleaned from local maxima by comparing each element of 1 to each element of 2 and removing all dominated elements Although the algorithm has excellent theoretical properties [3,17], there is no efficient implementation of this recursive process [5]. The main problem preventing an efficient implementation seems to be that the algorithm either requires massive disk IO, or needs to keep a large amount of intermediate results in main memory.…”

Random linear programs with many variables and few constraints

“…From this we easily obtain This problem has been studied in [5,6], and we suspect there are earlier references. [5,6] show that the expected value of U is 0(log n)…”

A unified approach for computing top-k pairs in multidimensional space

“…The average number of skyline pairs is estimated to be O(Log d−1 V ) [21]. Since V is at most O(N 2 ), the expected number of skyline pairs is O (Log d−1 N ).…”