Results 31 to 40 of about 11,984,557 (361)
Cellpose: a generalist algorithm for cellular segmentation
Nature Methods, 2020 Many biological applications require the segmentation of cell bodies, membranes and nuclei from microscopy images. Deep learning has enabled great progress on this problem, but current methods are specialized for images that have large training datasets.
C. Stringer +3 more
semanticscholar +1 more source
Virtual simulation of the heat exchanging process of a lithium-ion battery in a vehicle [PDF]
E3S Web of ConferencesThe article describes a virtual (numerical) model of part of the temperature control system of a lithium-ion battery developed for subsequent modeling of the required operating conditions as part of a vehicle.
Gaslov Sergey +2 more
doaj +1 more source
IEEE Transactions on Information Theory, 2001 LaTeX, 22 pages, 1 figure, with correction to the published journal ...
Vitanyi, P.M.B. +2 more
openaire +5 more sources
A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood.
Systematic Biology, 2003 The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods.
Stéphane Guindon, O. Gascuel
semanticscholar +1 more source
A novel swarm intelligence optimization approach: sparrow search algorithm
, 2020 In this paper, a novel swarm optimization approach, namely sparrow search algorithm (SSA), is proposed inspired by the group wisdom, foraging and anti-predation behaviours of sparrows.
Jiankai Xue, Bo Shen
semanticscholar +1 more source
Algorithm for Mesoscopic Advection-Diffusion [PDF]
, 2018 In this paper, an algorithm is presented to calculate the transition rates between adjacent mesoscopic subvolumes in the presence of flow and diffusion.
Makrakis, Dimitrios, Noel, Adam
core +2 more sources
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Molecular biology and evolution, 2014 Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to find optimal trees, it is not clear whether the best tree is found.
Lam-Tung Nguyen +3 more
semanticscholar +1 more source
Journal of Differential Equations, 1993 Consider the differential inclusion \((*)\) \(x'(t)\in F(t,x(t))\), where \(F\) is a given multifunction with values in finite dimensional space. A set \(K\) is called a viability set for \((*)\) if for every \(x_ 0\in K\) there exists a solution of \((*)\) starting from \(x_ 0\) which remains in \(K\).
COLOMBO, GIOVANNI, V. Krivan
openaire +2 more sources
Discrete Applied Mathematics, 2008 12 ...
David Eppstein, Jean-Claude Falmagne
openaire +3 more sources
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with B\"uchi Objectives [PDF]
, 2012 We consider Markov decision processes (MDPs) with \omega-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1.
Chatterjee, Krishnendu +3 more
core +1 more source