Results 41 to 50 of about 243 (214)
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
A Peer-Reviewed Journal About, 2019 This paper proposes a reconsideration of the aesthetic category of ‘glitch’ and advocates for a more careful theorisation around indexing — in the sense of both locating and naming — errors of a digital kind.
Carleigh Morgan
doaj +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 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
On the equivalence between classically verifiable position verification and certified randomness
Nature CommunicationsGate-based quantum computers can accelerate computational tasks beyond classical capabilities. Random circuit sampling is a task that has experimentally demonstrated algorithmic quantum advantage on near-term devices, but its practical utility has been ...
Fatih Kaleoglu +6 more
doaj +1 more source
The Boltzmann Entropy and Randomness Tests
EntropyIn the context of the dynamical systems of classical mechanics, we introduce two new notions called “algorithmic fine-grain and coarse-grain entropy”.
Peter Gács
doaj +1 more source
Probabilistic Analysis of Pattern Formation in Monotonic Self-Assembly. [PDF]
PLoS ONE, 2015 Inspired by biological systems, self-assembly aims to construct complex structures. It functions through piece-wise, local interactions among component parts and has the potential to produce novel materials and devices at the nanoscale.
Tyler G Moore +2 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
Nihon Kikai Gakkai ronbunshu, 2015 The complexity or randomness of the laminar-turbulent transition process of an inlet boundary layer in a circular pipe was analyzed by use of Kolmogorov complexity which is a very important measure of the randomness of various events. In the inlet region
Masashi ICHIMIYA +2 more
doaj +1 more source
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source