Sorting - Based Selection
نویسندگان
چکیده
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based on the selection algorithm of Cole and Yap, as well as on various sorting algorithms for hypercubic networks. Our fastest algorithm runs in O(lg n lg n) time, very nearly matching the trivial (lg n) lower bound. Previously, the best upper bound known for selection was O(lg n lg lg n).
منابع مشابه
P-20: Efficiency of Magnetic-Activated Cell Sorting System in Separation of Normal Sperm
Background Sperm preparation before assisted reproductive techniques is very important for obtaining successful fertilization and pregnancy. During ICSI technique, sperms are selected based on viability and morphology. But this selection did not guarantee integrity of sperm DNA. Therefore, novel sperm selection procedures are introduced for selection of sperm with low DNA damage. One of these p...
متن کاملAn Improved Hybrid Model with Automated Lag Selection to Forecast Stock Market
Objective: In general, financial time series such as stock indexes have nonlinear, mutable and noisy behavior. Structural and statistical models and machine learning-based models are often unable to accurately predict series with such a behavior. Accordingly, the aim of the present study is to present a new hybrid model using the advantages of the GMDH method and Non-dominated Sorting Genetic A...
متن کاملExperimental Based Selection of Best Sorting Algorithm
Sorting algorithm is one of the most basic research fields in computer science. Sorting refers to the operation of arranging data in some given order such as increasing or decreasing, with numerical data, or alphabetically, with character data. There are many sorting algorithms. All sorting algorithms are problem specific. The particular Algorithm one chooses depends on the properties of the da...
متن کاملLoad Balancing , Selection and Sorting on the HypercubeC
This paper presents novel load balancing, selection and sorting algorithms for the hypercube with 1-port communication. The main result is an algorithm for sorting n values on p processors, SmoothSort, that runs asymptotically faster (in the worst case) than any previously known algorithm over a wide range of the ratio n=p. The load balancing and selection algorithms upon which SmoothSort is ba...
متن کاملAlgorithm Selection for Sorting and Probabilistic Inference : a Machine Learning - Based Approach
The algorithm selection problem aims at selecting the best algorithm for a given computational problem instance according to some characteristics of the instance. In this dissertation, we first introduce some results from theoretical investigation of the algorithm selection problem. We show, by Rice’s theorem, the nonexistence of an automatic algorithm selection program based only on the descri...
متن کامل