Zobrazeno 1 - 10
of 451
pro vyhledávání: '"Shinkar A"'
Autor:
Gur, Tom, Jahanara, Mohammad Mahdi, Khodabandeh, Mohammad Mahdi, Rajgopal, Ninad, Salamatian, Bahar, Shinkar, Igor
We continue the study of doubly-efficient proof systems for verifying agnostic PAC learning, for which we obtain the following results. - We construct an interactive protocol for learning the $t$ largest Fourier characters of a given function $f \col
Externí odkaz:
http://arxiv.org/abs/2404.08158
In this paper we study a worst case to average case reduction for the problem of matrix multiplication over finite fields. Suppose we have an efficient average case algorithm, that given two random matrices $A,B$ outputs a matrix that has a non-trivi
Externí odkaz:
http://arxiv.org/abs/2404.08085
We study the problem of designing worst-case to average-case reductions for quantum algorithms. For all linear problems, we provide an explicit and efficient transformation of quantum algorithms that are only correct on a small (even sub-constant) fr
Externí odkaz:
http://arxiv.org/abs/2212.03348
Publikováno v:
Iranian Journal of Neonatology, Vol 15, Iss 2, Pp 20-27 (2024)
Background: Although endotracheal intubation is an emergency procedure that is frequently performed in neonatal care, there is still uncertainty about the best method for the estimation of the optimal depth of the endotracheal tube (ETT) in neonates.
Externí odkaz:
https://doaj.org/article/5e7050054e6449d689e035671077f659
Publikováno v:
Journal of Applied Pharmaceutical Research, Vol 12, Iss 2, Pp 35-41 (2024)
Background: HER2 (Human Epidermal Growth Receptor 2) positive breast cancer is an aggressive subtype. Treatment for patients with HER2-positive breast cancer has advanced significantly over time with the introduction of targeted therapies like trastu
Externí odkaz:
https://doaj.org/article/a2d77bc134ee47dbb386d055a729cebc
We present a new framework for designing worst-case to average-case reductions. For a large class of problems, it provides an explicit transformation of algorithms running in time $T$ that are only correct on a small (subconstant) fraction of their i
Externí odkaz:
http://arxiv.org/abs/2202.08996
Since 1989, the best known lower bound on static data structures was Siegel's classical cell sampling lower bound. Siegel showed an explicit problem with $n$ inputs and $m$ possible queries such that every data structure that answers queries by probi
Externí odkaz:
http://arxiv.org/abs/2108.05970
Publikováno v:
Global Journal of Medicine and Public Health, Vol 10, Iss 4 (2024)
Background The COVID-19 pandemic required the shutdown of academic institutions and, in India, the suspension of all in-person classes in March 2020. In-person teaching did not resume in Pt. Jawahar Lal Nehru Memorial Medical College, Raipur (Pt JNM
Externí odkaz:
https://doaj.org/article/c78efcd3b39f418899c77bd2b43e6c09
Publikováno v:
Global Journal of Medicine and Public Health, Vol 10, Iss 1 (2024)
Background Biostatistics, epidemiology, and vital statistics are an essential part of evidence-based medicine. They are used to generate results and analyze collected data. They are considered to be an important component of research study design for
Externí odkaz:
https://doaj.org/article/0baae776ead842a6b27ad1c61c0c2324
Autor:
Shinkar, Dina Mohamed1 dinashinkar@med.asu.edu.eg, El Sakka, Abeer Salah Eldin1, Raouf Abdel Hafiz, Maha Abdel2
Publikováno v:
Iranian Journal of Neonatology. Apr2024, Vol. 15 Issue 2, p20-27. 8p.