computing algorithms are a basic research area in computer science. In last years, many researchers proposed several sorting techniques to enhance time complexity and space complexity [8]. In this paper we present a s...
详细信息
ISBN:
(纸本)9781467384605
computing algorithms are a basic research area in computer science. In last years, many researchers proposed several sorting techniques to enhance time complexity and space complexity [8]. In this paper we present a sorting algorithm for any datatype, which uses mapping methodology. The mapping will be between elements of array and indexes without using any comparisons and swapping. The paper analyzes time complexity of proposed algorithm mathematically and empirically. The complexity of proposed algorithm is O(xlogm)+O(n) where n represents number of sorted elements and m, x<sorting algorithm is better than or almost equal to quick sorting.
It is difficult to obtain fairly satisfactory result for national costume images retrieval in real application using existing search engine due to the complexity of visual features and semantic information implied in ...
详细信息
ISBN:
(纸本)9781538609699
It is difficult to obtain fairly satisfactory result for national costume images retrieval in real application using existing search engine due to the complexity of visual features and semantic information implied in national costume. Given the fact, a novel sorting algorithm ImageRank is proposed for image retrieval with relevance feedback in this paper, inspired by the PageRank algorithm used by Google Search to rank websites or webpages in their search engine results. ImageRank is realized based on Lucene Image Retrieval (LIRE) toolkit, which is a Java library that provides a simple way to retrieve images and photos based on color and texture characteristics. And it assimilates a good deal of PageRank to accomplish efficient image retrieval by ensuring accurate level of images correlation in resource repository through update the indexical (points-to) relationship timely according to user's behavior dynamically. Experimental results investigate that the performance of ImageRank is better than LIRE. In addition, the conservativeness and convergence of IR value in ImageRank are also verified.
Aimed at uniformity of sorting about analytic hierarchy process(AHP),analytic hierarchy process based on grey incidence is brought *** sorting results are got through ways of different weights and several ***,overcomi...
详细信息
ISBN:
(纸本)9781479934348
Aimed at uniformity of sorting about analytic hierarchy process(AHP),analytic hierarchy process based on grey incidence is brought *** sorting results are got through ways of different weights and several ***,overcoming uniformity of sorting,complex process of rectifying judgment Matrix and consistence verification,that favor to analysis difference of algorithm and correctness of sorting results, more science and equitable sorting result is gained,it favor extension and application of AHP.
sorting is one of the most fundamental algorithms in Computer Science and a common operation in databases not just for sorting query results but also as part of joins (i.e., sort-merge-join) or indexing. In this work,...
详细信息
ISBN:
(纸本)9781450367356
sorting is one of the most fundamental algorithms in Computer Science and a common operation in databases not just for sorting query results but also as part of joins (i.e., sort-merge-join) or indexing. In this work, we introduce a new type of distribution sort that leverages a learned model of the empirical CDF of the data. Our algorithm uses a model to efficiently get an approximation of the scaled empirical CDF for each record key and map it to the corresponding position in the output array. We then apply a deterministic sorting algorithm that works well on nearly-sorted arrays (e.g., Insertion Sort) to establish a totally sorted order. We compared this algorithm against common sorting approaches and measured its performance for up to 1 billion normally-distributed double-precision keys. The results show that our approach yields an average 3.38x performance improvement over C++ STL sort, which is an optimized Quicksort hybrid, 1.49x improvement over sequential Radix Sort, and 5.54x improvement over a C++ implementation of Timsort, which is the default sorting function for Java and Python.
The Aircraft scheduling problem is researched in this paper, the equilibrium model of aircraft scheduling problem is proposed and a sorting algorithm is constructed. By introducing the concept of flight connections, a...
详细信息
ISBN:
(纸本)9783037855447
The Aircraft scheduling problem is researched in this paper, the equilibrium model of aircraft scheduling problem is proposed and a sorting algorithm is constructed. By introducing the concept of flight connections, aircraft scheduling problem is transformed into the distribution of flight connections, the mathematical model of the problem is established, to solve the model, a sorting algorithm is constructed. We use the airline's flight data to test the algorithm. The simulation results show that the model and the algorithm are feasible.
sorting algorithm is required for operating modular multilevel converter (MMC) with nearest level modulation, to keep the unbalanced submodule capacitor voltage within an acceptable range. Several sorting algorithms h...
详细信息
ISBN:
(纸本)9781728124551
sorting algorithm is required for operating modular multilevel converter (MMC) with nearest level modulation, to keep the unbalanced submodule capacitor voltage within an acceptable range. Several sorting algorithms have been proposed in previous literatures. However, very few papers discussed about how to select the execution frequency of a sorting algorithm. This paper aims to investigate on the impact of the execution frequency in sorting algorithm on the output voltage harmonics, average switching frequency, submodule capacitor voltage fluctuation of an MMC using nearest level modulation. Multiple MMC models with different number of submodules are built in MATLAB/Simulink. Three different types of sorting algorithms are implemented, and evaluated at various execution frequencies as well as different operating points. Conclusions drawn from the extensive simulations show that to select a sorting algorithm and its execution frequency, all three performance criterions should be considered simultaneous and a minimum execution frequency is always required.
In 1960, *** devised the Quick Sort algorithm. After that many people have tried to improve the ability of this algorithm, but they all didn't find a new one. Moreover it was proved that any sorting method which u...
详细信息
ISBN:
(纸本)7506251817
In 1960, *** devised the Quick Sort algorithm. After that many people have tried to improve the ability of this algorithm, but they all didn't find a new one. Moreover it was proved that any sorting method which uses comparisons on a array of size n must make at least O(nlogn) comparisons. In this paper, we present a new sorting algorithm named hash sort and compared it with the existing algorithms by experiments. The results clearly show that the new algorithm is more efficient than Quick Sort. Our new algorithm operates in linear time O(n).
Reducing the noise content in an image is the important factor in image processing and its applications. Some of the noises which cause a serious degradation in the image quality are multiplicative noise, salt and pep...
详细信息
ISBN:
(纸本)9781509059607
Reducing the noise content in an image is the important factor in image processing and its applications. Some of the noises which cause a serious degradation in the image quality are multiplicative noise, salt and pepper noise, impulse noise, gaussian noise, additive noise etc. Among these, salt and pepper noise can be eliminated using median filtering techniques. sorting techniques have been beneficial for median filtering. In this paper a highly efficient optimized sorting algorithm is implemented for median filter. Median filter is used to calculate the median of set of pixel values of a window. To compare the same column pixel values, data is acquired from FPGA parallely. The adjacent median filter results are saved temporarily using D flip-flops. This method increases the efficiency of execution by reducing the comparisons from 21 to 13 and significantly increases 40% efficiency. sorting algorithm is implemented using FPGA Spartan 6 LX45. It is cost efficient and also power efficient since it consumes half the power compared to earlier Spartan families.
sorting is technique by which elements are arranged in a particular order following some characteristic or law [1]. In this paper we presented an algorithm called as Relative Concatenate Sort, which is based on the id...
详细信息
暂无评论