Results 51 to 60 of about 2,741,379 (327)

On rates of convergence in the probabilistic analysis of algorithms [PDF]

, 2021
Within the last thirty years, the contraction method has become an important tool for the distributional analysis of random recursive structures. While it was mainly developed to show weak convergence, the contraction approach can additionally be used to obtain bounds on the rate of convergence in an appropriate metric.
openaire   +2 more sources

An Overview of Image Analysis Algorithms for License Plate Recognition

Organizacija, 2017
Background and purpose: We explore the problem of License Plate Recognition (LPR) to highlight a number of algorithms that can be used in image analysis problems.
Aboura Khalid, Al-Hmouz Rami
doaj   +1 more source

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations [PDF]

arXiv, 2020
Analyzing probabilistic programs and randomized algorithms are classical problems in computer science. The first basic problem in the analysis of stochastic processes is to consider the expectation or mean, and another basic problem is to consider concentration bounds, i.e. showing that large deviations from the mean have small probability.
arxiv  

Surfaceome: a new era in the discovery of immune evasion mechanisms of circulating tumor cells

Molecular Oncology, EarlyView.
In the era of immunotherapies, many patients either do not respond or eventually develop resistance. We propose to pave the way for proteomic analysis of surface‐expressed proteins called surfaceome, of circulating tumor cells. This approach seeks to identify immune evasion mechanisms and discover potential therapeutic targets. Circulating tumor cells (
Doryan Masmoudi, Jérome Vialaret, Christophe Hirtz, Catherine Alix‐Panabières   +3 more
wiley   +1 more source

2D graphical representation of dna sequence based on horizon lines from a probabilistic view

Bioscience Journal, 2018
In this study, we propose a new two-dimensional graphical representation of DNA sequence based on a choice of four horizon lines. The 2D representation is constructed in a probabilistic framework.
Huili Liu
doaj   +3 more sources

On Model-Checking Quantum Pushdown Systems, Extensions and $ω$-PCTL$^*$ Characterization of Weak Bisimulation [PDF]

arXiv, 2022
In this paper, we extend the notions of the {\em probabilistic pushdown systems} and {\em Markov chains} to their quantum analogues, and investigate the question whether it is necessary to define a quantum analogue of {\em probabilistic computational tree logic} to describe the probabilistic and branching-time properties of the {\em quantum Markov ...
arxiv  

Clinical applications of next‐generation sequencing‐based ctDNA analyses in breast cancer: defining treatment targets and dynamic changes during disease progression

Molecular Oncology, EarlyView.
Circulating tumor DNA (ctDNA) offers a possibility for different applications in early and late stage breast cancer management. In early breast cancer tumor informed approaches are increasingly used for detecting molecular residual disease (MRD) and early recurrence. In advanced stage, ctDNA provides a possibility for monitoring disease progression and
Eva Valentina Klocker, Samantha Hasenleithner, Rupert Bartsch, Simon P. Gampenrieder, Daniel Egle, Christian F. Singer, Gabriel Rinnerthaler, Michael Hubalek, Katja Schmitz, Zsuzsanna Bago‐Horvath, Andreas Petzer, Sonja Heibl, Ellen Heitzer, Marija Balic, Michael Gnant   +14 more
wiley   +1 more source

Circulating tumor DNA (ctDNA) trajectories predict survival in trifluridine/tipiracil‐treated metastatic colorectal cancer patients

Molecular Oncology, EarlyView.
The authors applied joint/mixed models that predict mortality of trifluridine/tipiracil‐treated metastatic colorectal cancer patients based on circulating tumor DNA (ctDNA) trajectories. Patients at high risk of death could be spared aggressive therapy with the prospect of a higher quality of life in their remaining lifetime, whereas patients with a ...
Matthias Unseld, Stefan Kühberger, Ricarda Graf, Christine Beichler, Markus Braun, Nadia Dandachi, Ellen Heitzer, Gerald W. Prager   +7 more
wiley   +1 more source

Probabilistic Resource-Aware Session Types [PDF]

arXiv, 2020
Session types guarantee that message-passing processes adhere to predefined communication protocols. Prior work on session types has focused on deterministic languages but many message-passing systems, such as Markov chains and randomized distributed algorithms, are probabilistic. To model and analyze such systems, this article introduces probabilistic
arxiv  

Abstraction-based Probabilistic Stability Analysis of Polyhedral Probabilistic Hybrid Systems [PDF]

arXiv, 2023
In this paper, we consider the problem of probabilistic stability analysis of a subclass of Stochastic Hybrid Systems, namely, Polyhedral Probabilistic Hybrid Systems (PPHS), where the flow dynamics is given by a polyhedral inclusion, the discrete switching between modes happens probabilistically at the boundaries of their invariant regions and the ...
arxiv