Results 41 to 50 of about 190,858 (265)
A Heuristic for Graph Coloring Based on the Ising Model
MathematicsWe propose a dynamic extension of the Petford–Welsh coloring algorithm that estimates the chromatic number of a graph without requiring k as an input.
Omkar Bihani, Janez Žerovnik
doaj +1 more source
Applied Sciences, 2021 The inversion of potential field data has widely utilized the generalized cross-validation (GCV) and the unbiased predictive risk estimator (UPRE) methods to determine the regularization parameter.
Yuan Fang +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Keratin 19 (KRT19) is overexpressed in high‐grade serous ovarian cancer with high levels of Kallikrein‐related peptidases (KLK) 4–7 and is associated with poor survival. In vivo analyses demonstrate that elevated KRT19 increases peritoneal tumour burden.
Sophia Bielesch +13 more
wiley +1 more source
An introduction to randomized algorithms
Discrete Applied Mathematics, 1991 The concept of randomization is known to be an extremely important tool for the design of algorithms. Its use often yields better time or space complexity compared with the best deterministic algorithms we know of for the same problem; moreover resulting randomized algorithms are often very simple to understand and implement.
openaire +1 more source
A randomized maximum-flow algorithm [PDF]
30th Annual Symposium on Foundations of Computer Science, 1989 Summary: A randomized algorithm for computing a maximum flow is presented. For an \(n\)-vertex \(m\)-edge network, the running time is \(O(nm + n^2 (\log n)^2)\) with probability at least \(1 - 2^{- \sqrt {nm}}\). The algorithm is always correct, and in the worst case runs in \(O(nm \log n)\) time.
Cheriyan, J., Hagerup, T.
openaire +2 more sources
Randomized and Optimal Algorithms for
IEEE Access, 2022 In wireless sensor networks, rotating dominating set is an efficient method for balancing the energy consumption of nodes, and thereby extending the network operational time.
Weizhong Luo, Junbin Liang, Tianshu Wang
doaj +1 more source
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
A Monad for Randomized Algorithms
Electronic Notes in Theoretical Computer Science, 2016 AbstractIn this paper, we introduce a monad of random choice for domains that does not suffer from the main two drawbacks of the probabilistic powerdomain. It is not known whether any Cartesian closed category of domains is closed under the probabilistic powerdomain, but the Cartesian closed category BCD is closed under this monad of random choice ...
openaire +1 more source
General Position Subset Selection in Line Arrangements
AlgorithmsGiven a set of n points in a plane, the General Position Subset Selection problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear.
Adrian Dumitrescu
doaj +1 more source
Molecular Oncology, EarlyView.EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source