Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Nicolas Bonifas"'
Autor:
Gaëtan Mignanelli, Richard Boyer, Nicolas Bonifas, Emmanuel Rineau, Yassine Moussali, Morgan Le Guen
Publikováno v:
JMIR Perioperative Medicine, Vol 6, p e49186 (2023)
BackgroundMajor surgery on patients with anemia has demonstrated an increased risk of perioperative blood transfusions and postoperative morbidity and mortality. Recent studies have shown that integrating preoperative anemia treatment as a component
Externí odkaz:
https://doaj.org/article/eb57481a35c24cf78ac2fbe3aa31941a
Autor:
Jacques-Henri Veyron, Patrick Friocourt, Olivier Jeanjean, Laurence Luquel, Nicolas Bonifas, Fabrice Denis, Joël Belmin
Publikováno v:
PLoS ONE, Vol 14, Iss 8, p e0220002 (2019)
BackgroundOlder individuals receiving home assistance are at high risk for emergency visits and unplanned hospitalization. Anticipating their health difficulties could prevent these events. This study investigated the effectiveness of an at-home moni
Externí odkaz:
https://doaj.org/article/7d80b543a2ba4c27b86ba7036c0a3ebe
Autor:
Gaëtan Mignanelli, Richard Boyer, Nicolas Bonifas, Emmanuel Rineau, Yassine Moussali, Morgan Le Guen
BACKGROUND Major surgery on anemic patients has demonstrated an increased risk of perioperative blood transfusions and postoperative morbidity and mortality. Recent studies have shown that integrating preoperative anemia treatment as a component of P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c4701237c1d92e612e16214f1ac7442
https://doi.org/10.2196/preprints.49186
https://doi.org/10.2196/preprints.49186
Autor:
Philippe Baptiste, Nicolas Bonifas
Publikováno v:
Discrete Applied Mathematics. 234:168-177
We introduce a reformulation of the cumulative resource in scheduling. This reformulation yields a lower bound on the makespan which is at least as good as that of a preemptive schedule on the original resource. Its computation relies on a linear pro
Publikováno v:
Discrete {&} Computational Geometry
Symposium on Computational Geometry
Symposium on Computational Geometry
We derive a new upper bound on the diameter of a polyhedron $$P = \{x {\in } {\mathbb {R}}^n :Ax\le b\}$$ P = { x ? R n : A x ≤ b } , where $$A \in {\mathbb {Z}}^{m\times n}$$ A ? Z m × n . The bound is polynomial in $$n$$ n and the largest absolu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f4423621cb3ed9bee9032f116fdfa4a
http://doc.rero.ch/record/325897/files/454_2014_Article_9601.pdf
http://doc.rero.ch/record/325897/files/454_2014_Article_9601.pdf
Autor:
Nicolas Bonifas, Laurence Luquel, Olivier Jeanjean, Joël Belmin, Jacques-Henri Veyron, Patrick Friocourt, Fabrice Denis
Publikováno v:
PLoS ONE
PLoS ONE, Public Library of Science, 2019, 14 (8), pp.e0220002. ⟨10.1371/journal.pone.0220002⟩
PLoS ONE, Vol 14, Iss 8, p e0220002 (2019)
PLoS ONE, Public Library of Science, 2019, 14 (8), pp.e0220002. ⟨10.1371/journal.pone.0220002⟩
PLoS ONE, Vol 14, Iss 8, p e0220002 (2019)
BackgroundOlder individuals receiving home assistance are at high risk for emergency visits and unplanned hospitalization. Anticipating their health difficulties could prevent these events. This study investigated the effectiveness of an at-home moni
Autor:
Daniel Dadush, Nicolas Bonifas
Improving on the Voronoi cell based techniques of [28, 24], we give a Las Vegas eO (2n) expected time and space algo- rithm for CVPP (the preprocessing version of the Closest Vector Problem, CVP). This improves on the eO (4n) deter- ministic runtime
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b406d13cc9f535bea5ca35efdac4f256
https://ir.cwi.nl/pub/24059
https://ir.cwi.nl/pub/24059