Results 21 to 30 of about 283,157 (282)
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
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
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
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
Radix Sorting With No Extra Space
, 2007 It is well known that n integers in the range [1,n^c] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1,U] can be sorted in O(n sqrt{loglog n}) time.
Franceschini, Gianni +2 more
core +1 more source
The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity
FEBS Letters, EarlyView.The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley +1 more source
Selecting sorting centres to avoid long distance transport of weaned beef calves
Scientific Reports, 2021 The transport of weaned calves from cow–calf producers to fatteners is a general concern for the young bull industry due to its documented negative impact on the welfare, health and performance of the animals.
T. Morel-Journel +4 more
doaj +1 more source
Research on key technologies of intelligent gangue sorting robot
Gong-kuang zidonghua, 2022 This paper introduces the application and research status of the intelligent gangue sorting robot. This paper points out that the intelligent gangue sorting robot is mainly based on the principle of X-ray and image identification.
ZHANG Yuanhao +5 more
doaj +1 more source
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source