A fast sorting algorithm for VLSI

2006 ◽  
pp. 408-419 ◽  
Author(s):  
Hans -Werner Lang ◽  
Manfred Schimmler ◽  
Hartmut Schmeck ◽  
Heiko Schröder
Keyword(s):  
Sorting Algorithm

An Adaptive Sorting Algorithm for Almost Sorted List

2017 ◽  
Vol 5 (12) ◽  
pp. 169-172
Author(s):  
Rina Damdoo ◽  
◽  
◽  
Kanak Kalyani
Keyword(s):  
Sorting Algorithm ◽  
Adaptive Sorting

Comparative Analysis and Implementation of Popular Sorting Algorithm

2019 ◽  
Author(s):  
Jatin Goel ◽  
Avnish Gupta ◽  
Nikhil Tripathi ◽  
Ravi Tomar ◽  
Tanupriya Choudhury
Keyword(s):  
Comparative Analysis ◽  
Sorting Algorithm

A constant-time parallel sorting algorithm and its optical implementation

IEEE Micro ◽  
1995 ◽  
Vol 15 (3) ◽  
pp. 60-71 ◽  
Author(s):  
A. Louri ◽  
J.A. Hatch ◽  
Jongwhoa Na
Keyword(s):  
Constant Time ◽  
Sorting Algorithm ◽  
Parallel Sorting

Recognition of teaching method effects based on grid model simplification and artificial intelligence

2020 ◽  
pp. 1-11
Author(s):  
Guo Yunfeng ◽  
Li Jing
Keyword(s):  
Artificial Intelligence ◽  
Teaching Method ◽  
Evaluation Model ◽  
Geometric Constraints ◽  
Sorting Algorithm ◽  
Grid Model ◽  
Model Based ◽  
Refinement Method ◽  
Method Effects ◽  
Structure Simplification

In order to improve the effect of the teaching method evaluation model, based on the grid model, this paper constructs an artificial intelligence model based on the grid model. Moreover, this paper proposes a hexahedral grid structure simplification method based on weighted sorting, which comprehensively sorts the elimination order of candidate base complexes in the grid with three sets of sorting items of width, deformation and price improvement. At the same time, for the elimination order of basic complex strings, this paper also proposes a corresponding priority sorting algorithm. In addition, this paper proposes a smoothing regularization method based on the local parameterization method of the improved SLIM algorithm, which uses the regularized unit as the reference unit in the local mapping in the SLIM algorithm. Furthermore, this paper proposes an adaptive refinement method that maintains the uniformity of the grid and reduces the surface error, which can better slow down the occurrence of geometric constraints caused by insufficient number of elements in the process of grid simplification. Finally, this paper designs experiments to study the performance of the model. The research results show that the model constructed in this paper is effective.

A Design of ID Sorting Module Based on Quick Sorting Algorithm

2020 ◽  
Author(s):  
Haonan Tang ◽  
Shuqin Geng ◽  
Xiaohong Peng ◽  
Shuaiqi Yan ◽  
Yan Zhang ◽  
...  
Keyword(s):  
Sorting Algorithm

scholarly journals A NEW DENOISING APPROACH FOR THE REMOVAL OF IMPULSE NOISE FROM COLOR IMAGES AND VIDEO SEQUENCES

2012 ◽  
Vol 31 (3) ◽  
pp. 185 ◽  
Author(s):  
Rajamani Arumugham ◽  
Krishnaveni Vellingiri ◽  
Wassim Ferose Habeebrakuman ◽  
Kalaikamal Mohan
Keyword(s):  
Impulse Noise ◽  
Visual Quality ◽  
Color Images ◽  
Video Sequences ◽  
Computational Time ◽  
Sorting Algorithm ◽  
Salt And Pepper Noise ◽  
Video Signals ◽  
Salt And Pepper

In this paper a novel Lone Diagonal Sorting (LDS) algorithm for denoising color images and videos co-rrupted with salt and pepper noise is proposed. The proposed lone diagonal sorting algorithm uses diagonal sorting alone for denoising of impulse noise. The algorithm has been implemented and tested for various color images and video signals and appreciable performance in terms of PSNR, MSE and SSIM is obtained. Our algorithm has been compared with other standard algorithms. A drastic improvement in the computational time has been achieved without compromising much on the visual quality after reconstruction.

A new parallel sorting algorithm based upon min-mid-max operations

1984 ◽  
Vol 24 (2) ◽  
pp. 187-195 ◽  
Author(s):  
S. S. Tseng ◽  
R. C. T. Lee
Keyword(s):  
Sorting Algorithm ◽  
Parallel Sorting
Sign in / Sign up

Export Citation Format

Share Document