Results 21 to 30 of about 277,393 (334)
Generating Almost Descending Sequences to Reduce the Number of Movements in Sorting
IEEE Access, 2022 Sorting algorithms usually generate strictly descending sequences. However, almost descending sequences may be sufficient to fulfill our needs in practice, and the number of movements needed for generating such sequences can be greatly reduced. We call a
Yuyin Yu, Xuan Xiao
doaj +1 more source
An empirical study on SAJQ (Sorting Algorithm for Join Queries)
Egyptian Informatics Journal, 2010 Most queries that applied on database management systems (DBMS) depend heavily on the performance of the used sorting algorithm. In addition to have an efficient sorting algorithm, as a primary feature, stability of such algorithms is a major feature ...
Hassan I. Mathkour
doaj +1 more source
Modified capacitor voltage balancing sorting algorithm for modular multilevel converter
The Journal of Engineering, 2019 The modular multilevel converter (MMC) with large-scale sub-modules has the advantage of simpler modulation, lower switching frequency, and lower harmonic component, thus would be very promising in voltage source converter (VSC)–high voltage direct ...
Jie Zhang +5 more
doaj +1 more source
Heuristic Spike Sorting Tuner (HSST), a framework to determine optimal parameter selection for a generic spike sorting algorithm [PDF]
, 2020 Extracellular microelectrodes frequently record neural activity from more than one neuron in the vicinity of the electrode. The process of labeling each recorded spike waveform with the identity of its source neuron is called spike sorting and is often ...
Bjånes, David A. +3 more
core
Fuzzy fixed points of generalized F-2-Geraghty type fuzzy mappings and complementary results
Nonlinear Analysis, 2016 The aim of this paper is to introduce generalized F2-Geraghty type fuzzy mappings on a metric space for establishing the existence of fuzzy fixed points of such mappings.
Mujahid Abbas +3 more
doaj +1 more source
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud [PDF]
, 2014 We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting. Our method can be used to improve previous oblivious storage solutions for network-based
B. Pinkas +6 more
core +1 more source
An Enhanced Multiway Sorting Network Based on n-Sorters
, 2014 Merging-based sorting networks are an important family of sorting networks. Most merge sorting networks are based on 2-way or multi-way merging algorithms using 2-sorters as basic building blocks. An alternative is to use n-sorters, instead of 2-sorters,
Shi, Feng, Wagh, Meghanad, Yan, Zhiyuan
core +1 more source
Fast construction of FM-index for long sequence reads [PDF]
, 2014 Summary: We present a new method to incrementally construct the FM-index for both short and long sequence reads, up to the size of a genome. It is the first algorithm that can build the index while implicitly sorting the sequences in the reverse ...
Li, Heng
core +1 more source
Matrix Sort - A Parallelizable Sorting Algorithm
International Journal of Computer Applications, 2016 Sorting algorithms are the class of algorithms that result in the ordered arrangement of a list of given elements. The arrangement can be in ascending or descending order based on the requirement given. Time complexity, space complexity and optimality are used to assess the algorithms.
A B Saketh, V Vijay, S. Kavitha
openaire +2 more sources
Parallel Multidimensional Lookahead Sorting Algorithm
IEEE Access, 2019 This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be controlled using several parameters such as the number of threads,
Fayez Gebali +4 more
doaj +1 more source