Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Adam Nadolski"'
Autor:
Dariusz Dereniowski, Adam Nadolski
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 10, Iss 3 (2008)
In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models. We prove that every outerplanar bipartite gra
Externí odkaz:
https://doaj.org/article/f787efbc254f4710b369a60be0f0d6f8
Autor:
Virag Shah, Kiyetta Alade, Jesse J. Brennan, Edward M. Castillo, Anthony J. Medak, Stephanie J. Doniger, Samuel H.F. Lam, Adam Nadolski, Joni E. Rabiner, Marla C. Levine, Adam Sivitz
Publikováno v:
The Journal of Emergency Medicine. 58:457-463
Background Point-of-care ultrasound (POCUS) is commonly used to facilitate care in the emergency department. Acquired images are often reviewed by local experts for educational and quality assurance purposes. However, no published study has examined
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ea44968db71c546188bded59af400a2
https://doi.org/10.1016/j.jemermed.2019.10.028
https://doi.org/10.1016/j.jemermed.2019.10.028
Autor:
Ryan M McKee, Stephen R. Hayden, Amir Aminlari, Rachna Subramony, Vaishal M. Tolia, Jennifer Stone, Adam Nadolski
Publikováno v:
The Journal of emergency medicine. 61(5)
Background Achilles tendon rupture is a common injury with increasing incidence due to the rising popularity of high-velocity sports, continued physical activity of the aging American population, and use of fluoroquinolones and steroid injections. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6cb218c3d40995f2639288df8c72b0e
https://pubmed.ncbi.nlm.nih.gov/34801318
https://pubmed.ncbi.nlm.nih.gov/34801318
Autor:
Alexis Moinet, Thomas Drugman, Wiktor Dolecki, Rafal Kuklinski, Thomas Merritt, Adam Nadolski, Nikko Strom, Viacheslav Klimkov, Andrew Paul Breen, Roberto Barra-Chicote, Daniel Korzekwa, Tianjun Ye, Bartosz Putrycz
Publikováno v:
SLT
Statistical TTS systems that directly predict the speech waveform have recently reported improvements in synthesis quality. This investigation evaluates Amazon's statistical speech waveform synthesis (SSWS) system. An in-depth evaluation of SSWS is c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96ab90e460c5794438708900dc7f6495
https://doi.org/10.1109/slt.2018.8639556
https://doi.org/10.1109/slt.2018.8639556
Publikováno v:
SLT
Recurrent Neural Networks (RNN) have recently proved to be effective in acoustic modeling for TTS. Various techniques such as the Maximum Likelihood Parameter Generation (MLPG) algorithm have been naturally inherited from the HMM-based speech synthes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a158614ae3cda5c11e7461cce66caf8
https://doi.org/10.1109/slt.2018.8639626
https://doi.org/10.1109/slt.2018.8639626
Autor:
Thomas Merritt, Alexis Moinet, Thomas Drugman, Adam Nadolski, Viacheslav Klimkov, Roberto Barra-Chicote, Bartosz Putrycz
Publikováno v:
INTERSPEECH
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d4c9fc70325df39fa67e79b037b79c4
https://doi.org/10.21437/interspeech.2017-419
https://doi.org/10.21437/interspeech.2017-419
Autor:
Adam Nadolski
Publikováno v:
Discrete Mathematics. 308:2407-2417
The paper is devoted to a model of compact cyclic edge-coloring of graphs. This variant of edge-coloring finds its applications in modeling schedules in production systems, in which production proceeds in a cyclic way. We point out optimal colorings
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf4c9196ef15ce2d28e533634a49ba6a
https://doi.org/10.1016/j.disc.2006.09.058
https://doi.org/10.1016/j.disc.2006.09.058
Autor:
Adam Nadolski
Publikováno v:
Discrete Mathematics. 307:1447-1454
In this paper we consider the circular edge coloring of four families of Class 2 graphs. For the first two we establish the exact value of the circular chromatic index. For the next two, namely Goldberg and Isaacs snarks we derive an upper bound on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f65c781694a2a305da25a469efc362b2
https://doi.org/10.1016/j.disc.2005.11.092
https://doi.org/10.1016/j.disc.2005.11.092
Autor:
Adam Nadolski, Dariusz Dereniowski
Publikováno v:
Information Processing Letters. 98:96-100
In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem of vertex ranking of weighted trees to the vertex ranking of (simple) cho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cd2369852d7ca98cdf4da491d188306
https://doi.org/10.1016/j.ipl.2005.12.006
https://doi.org/10.1016/j.ipl.2005.12.006
Autor:
Zdzisław Kamont, Adam Nadolski
Publikováno v:
Demonstratio Mathematica. 38:977-996
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::808cb86c15eb937a65eb6c3b5ad39358
https://doi.org/10.1515/dema-2005-0423
https://doi.org/10.1515/dema-2005-0423