Zobrazeno 1 - 10
of 58
pro vyhledávání: '"David Julien"'
Autor:
Christopher Price, Julia L Newton, Yu Fu, Shona Haining, Paula Whitty, Bob Gaffney, David Julien
Publikováno v:
BMJ Open, Vol 12, Iss 11 (2022)
Objectives The North East of England, ranked as having the highest poverty levels and the lowest health outcomes, has the highest cardiovascular disease (CVD) premature mortality. This study aimed to compare CVD-related conditions and risk factors fo
Externí odkaz:
https://doaj.org/article/b93aae0dd919426dae9dbc1fca224835
Autor:
Ernesto Chinkes, David Julien
Publikováno v:
Ciencia y Educación, Vol 3, Iss 1 (2019)
Este artículo nos introduce en la era digital, tratando de evidenciar la relevancia e impacto que tiene en la sociedad contemporánea. Se identifican las principales tecnologías disruptivas que la están formateando y cómo, a partir de estas, se e
Externí odkaz:
https://doaj.org/article/88601f5f6c994e23a3e2425a17359eca
Cartesian tree pattern matching consists of finding all the factors of a text that have the same Cartesian tree than a given pattern. There already exist theoretical and practical solutions for the exact case. In this paper, we propose the first algo
Externí odkaz:
http://arxiv.org/abs/2306.16065
Autor:
Khammari Amir, Rodde-Astier Isabelle, Pandolfino Marie-Christine, Bercegeay Sylvain, David Julien, Zuliani Thomas, Coissac Cécile, Delorme Bruno, Saïagh Soraya, Dréno Brigitte
Publikováno v:
Journal of Translational Medicine, Vol 9, Iss 1, p 63 (2011)
Abstract Background Adoptive cell therapy (ACT) has emerged as an effective treatment for patients with metastatic melanoma. However, there are several logistical and safety concerns associated with large-scale ex vivo expansion of tumour-specific T
Externí odkaz:
https://doaj.org/article/7a94ff3afd3847338be2efe71cf90e52
Publikováno v:
J. Comb. Theory A 172, 105200 (2020)
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either inserting or delet
Externí odkaz:
http://arxiv.org/abs/1810.00185
In this paper, we study a parallel version of Galton-Watson processes for the random generation of tree-shaped structures. Random trees are useful in many situations (testing, binary search, simulation of physics phenomena,...) as attests more than 4
Externí odkaz:
http://arxiv.org/abs/1606.06629
Publikováno v:
In Journal of Combinatorial Theory, Series A May 2020 172
We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial distribution over te
Externí odkaz:
http://arxiv.org/abs/1109.5683
Publikováno v:
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 123-134
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state minimization algorithm is in O(n log n). Moreover this bound is tight
Externí odkaz:
http://arxiv.org/abs/0902.1048
Publikováno v:
In Theoretical Computer Science 6 September 2015 596:124-141