Zobrazeno 1 - 10
of 414
pro vyhledávání: '"Pardey P"'
Autor:
Runck, Bryan C., Schulz, Bobby, Bishop, Jeff, Carlson, Nathan, Chantigian, Bryan, Deters, Gary, Erdmann, Jesse, Ewing, Patrick M., Felzan, Michael, Fu, Xiao, Greyling, Jan, Hogan, Christopher J., Hollman, Andrew, Joglekar, Ali, Junker, Kris, Kantar, Michael, Kaunda, Lumbani, Krishna, Mohana, Lynch, Benjamin, Marchetto, Peter, Marsolek, Megan, McKay, Troy, Morris, Brad, Niaghi, Ali Rashid, Pamulaparthy, Keerthi, Pardey, Philip, Piotrowski, Ann, Poudyal, Christina, Prather, Tom, Raghavan, Barath, Reiter, Maggie, Rosen, Lucas, Salazar, Benjamin, Scobbie, Andrew, Sharma, Vasudha, Silverstein, Kevin A. T., Singh, Gurparteet, Strock, Jeff, Subedi, Samikshya, Tang, Evan, Turturillo, Gianna, Watkins, Eric, Webster, Blake, Wilgenbusch, James
With the increasing emphasis on machine learning and artificial intelligence to drive knowledge discovery in the agricultural sciences, spatial internet of things (IoT) technologies have become increasingly important for collecting real-time, high re
Externí odkaz:
http://arxiv.org/abs/2403.19477
Autor:
Andreas Janßen, Nicolas Pardey, Jan Zeidler, Christian Krauth, Jochen Blaser, Carina Oedingen, Hans Worthmann
Publikováno v:
Health Economics Review, Vol 14, Iss 1, Pp 1-10 (2024)
Abstract Background Acute stroke treatment is time-critical. To provide qualified stroke care in areas without 24/7 availability of a stroke neurologist, the concept of teleneurology was established, which is based on remote video communication throu
Externí odkaz:
https://doaj.org/article/6545813c80e1426793151bdcf675e0ef
Do\v{s}li\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$
Externí odkaz:
http://arxiv.org/abs/2306.09089
Autor:
Pardey, Johannes, Rautenbach, Dieter
Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular, for $d_+\i
Externí odkaz:
http://arxiv.org/abs/2301.07953
Autor:
Jocelyn L Bowden, Kathryn Mills, Justine M Naylor, Joseph Descallar, Robert Boland, Margery Pardey, Amy Orsatti
Publikováno v:
BMJ Open, Vol 14, Iss 10 (2024)
Introduction First steps for knee osteoarthritis (OA) is a cluster randomised implementation trial examining the effect of an educational reminder message included in knee X-ray reports on the proportion of people subsequently referred to exercise pr
Externí odkaz:
https://doaj.org/article/8216353b58904cf1917ce9897e843fc4
Do\v{s}li\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$
Externí odkaz:
http://arxiv.org/abs/2211.06682
Do\v{s}li\'{c} et al.~defined the Mostar index of a graph $G$ as $\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than
Externí odkaz:
http://arxiv.org/abs/2210.03399
Autor:
Bock, Felix, Kalinowski, Rafał, Pardey, Johannes, Pilśniak, Monika, Rautenbach, Dieter, Woźniak, Mariusz
We propose the notion of a majority $k$-edge-coloring of a graph $G$, which is an edge-coloring of $G$ with $k$ colors such that, for every vertex $u$ of $G$, at most half the edges of $G$ incident with $u$ have the same color. We show the best possi
Externí odkaz:
http://arxiv.org/abs/2205.11125
The independence number $\alpha(G)$ and the dissociation number ${\rm diss}(G)$ of a graph $G$ are the largest orders of induced subgraphs of $G$ of maximum degree at most $0$ and at most $1$, respectively. We consider possible improvements of the ob
Externí odkaz:
http://arxiv.org/abs/2205.03404
The dissociation number ${\rm diss}(G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$. Computing the dissociation number of a given graph is algorithmically hard even when re
Externí odkaz:
http://arxiv.org/abs/2202.09190