Results 131 to 140 of about 22,781,989 (354)

MEAN-OF-2-4 QUICKSORT

Journal of Engineering Science (Chişinău)
By combining the Median-of-three and Regrouping-3 quicksort methods, the Joint quicksort is proposed, largely free from the shortcomings of the first two. For example, the time complexity of Joint quicksort, in case of lists of n equal elements, is O(n).
BOLUN, Ion
doaj   +1 more source

Permutation extropy: a time series complexity measure [PDF]

arXiv
On account of a greater need for understanding the complexity of time series like physiological time series, financial time series, and many more that enter into picture for their inculpation with real-world problems, several complexity parameters have already been proposed in the literature.
arxiv  

Design of Low Complexity GFDM Transceiver [PDF]

arXiv, 2018
In this work, we propose a novel low complexity Generalised Frequency Division Multiplexing (GFDM) transceiver design. GFDM modulation matrix is factorized into FFT matrices and a diagonal matrix to design low complexity GFDM transmitter. Factorization of GFDM modulation matrix is used to derive low complexity Matched Filter (MF), Zero Forcing (ZF) and
arxiv  

Cell‐free and extracellular vesicle microRNAs with clinical utility for solid tumors

Molecular Oncology, EarlyView.
Cell‐free microRNAs (cfmiRs) are small‐RNA circulating molecules detectable in almost all body biofluids. Innovative technologies have improved the application of cfmiRs to oncology, with a focus on clinical needs for different solid tumors, but with emphasis on diagnosis, prognosis, cancer recurrence, as well as treatment monitoring.
Yoshinori Hayashi, Janelle‐Cheri Millen, Romela Irene Ramos, Jennifer A. Linehan, Timothy G. Wilson, Dave S. B. Hoon, Matias A. Bustos   +6 more
wiley   +1 more source

The effect of genetic complexity on the time-course of ribonucleic acid–deoxyribonucleic acid hybridization [PDF]

, 1969
John O. Bishop
openalex   +1 more source

New related-key rectangle attack on 42-round SHACAL-2

Tongxin xuebao, 2009
A new 34-round related-key rectangle distinguisher was constructed by exploiting the properties of the round transform of SHACAL-2. Moreover, two new relate-key rectangle attacks on 40-round and 42-round reduced SHACAL-2 were presented by using both the ...
WEI Yong-zhuang1, 2
doaj  

Approximating a Minimum Dominating Set by Purification

Algorithms
A dominating set of a graph is a subset of vertices such that every vertex not in the subset has at least one neighbor within the subset. The corresponding optimization problem is known to be NP-hard.
Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, José Alberto Hernández-Aguilar   +3 more
doaj   +1 more source

KRAS and GNAS mutations in cell‐free DNA and in circulating epithelial cells in patients with intraductal papillary mucinous neoplasms—an observational pilot study

Molecular Oncology, EarlyView.
This study demonstrates that KRAS and GNAS mutations are more prevalent in patients with resected intraductal papillary mucinous neoplasms (IPMN) compared to those under clinical surveillance. GNAS mutations significantly differ between the two patient cohorts, indicating that their absence may serve as a potential biomarker to support conservative ...
Christine Nitschke, Marie Tölle, Philipp Walter, Kira Meißner, Mara Goetz, Jolanthe Kropidlowski, Andreas W. Berger, Jakob R. Izbicki, Felix Nickel, Thilo Hackert, Klaus Pantel, Harriet Wikman, Faik G. Uzunoglu   +12 more
wiley   +1 more source

On the time and tape complexity of hyper(1)-AFL's [PDF]

, 1977
W. Erni
openalex   +1 more source

On finding a satisfactory partition in an undirected graph: algorithm design and results

AIMS Mathematics
A satisfactory partition is a partition of undirected-graph vertices such that the partition has only two nonempty parts, and every vertex has at least as many adjacent vertices in its part as it has in the other part.
Samer Nofal
doaj   +1 more source