Results 21 to 30 of about 285,472 (282)
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
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
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
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
, 2003 We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports.
Franceschini, Gianni, Geffert, Viliam
core +2 more sources
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.
Saketh A., Vijay V., S. Kavitha
openaire +1 more source
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
QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average
, 2013 In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort. Given some external sorting algorithm X, QuickXsort yields an internal sorting algorithm if X satisfies certain natural conditions.
A. Elmasry +11 more
core +1 more source
IEEE Open Journal of the Industrial Electronics SocietyModulation techniques for Modular Multilevel Converters (MMCs) encounter a limit in the tradeoff between reducing the total harmonic distortion (THD) of the load current and minimizing the number of commutations, primarily due to traditional sorting ...
Anthony Abdayem +5 more
doaj +1 more source
Improving the performance of bubble sort using a modified diminishing increment sorting [PDF]
, 2009 Sorting involves rearranging information into either ascending or descending order. There are many sorting algorithms, among which is Bubble Sort.
Oyelami, O. M.
core