Zobrazeno 1 - 10
of 63 100
pro vyhledávání: '"A, Weimann"'
Publikováno v:
Annals of Nutrition & Metabolism, 2018 Jan 01. 72(3), 177-177.
Externí odkaz:
https://www.jstor.org/stable/48508351
Autor:
Krasicki, Jan
Publikováno v:
Studia Philosophica Wratislaviensia. 17(4):111-113
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=1115505
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
DRAKAKIS, JOHN
Publikováno v:
Shakespeare Studies (Rosemont Publishing & Printing Corporation). 1998, Vol. 26, p83. 22p.
ChatGPT disrupted the application of machine-learning methods and drastically reduced the usage barrier. Chatbots are now widely used in a lot of different situations. They provide advice, assist in writing source code, or assess and summarize inform
Externí odkaz:
http://arxiv.org/abs/2406.16572
Autor:
Poteaux, Adrien, Weimann, Martin
We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to the size of the output when the residual characteristic is zero or big
Externí odkaz:
http://arxiv.org/abs/2405.13577
Autor:
Schalkwyk, David
Publikováno v:
Renaissance Quarterly, 2009 Jun . 62(2), 634-635.
Externí odkaz:
https://www.jstor.org/stable/10.1086/599966
Autor:
Reinhold, Kirsten (AUTHOR)
Publikováno v:
TextilWirtschaft Online. 3/27/2024, pN.PAG-N.PAG. 1p.
Autor:
Ofek, E. O., Shvartzvald, Y., Sharon, A., Tishler, C., Elhanati, D., Segev, N., Ben-Ami, S., Nir, G., Segre, E., Sofer-Rimalt, Y., Blumenzweig, A., Strotjohann, N. L., Polishook, D., Krassilchtchikov, A., Zenin, A., Ramazani, V. Fallah, Weimann, S., Garrappa, S., Shanni, Y., Chen, P., Zimmerman, E.
The Large Array Survey Telescope (LAST) is a wide-field telescope designed to explore the variable and transient sky with a high cadence and to be a test-bed for cost-effective telescope design. A LAST node is composed of 48 (32 already deployed), 28
Externí odkaz:
http://arxiv.org/abs/2310.13063
We show how to assign labels of size $\tilde O(1)$ to the vertices of a directed planar graph $G$, such that from the labels of any three vertices $s,t,f$ we can deduce in $\tilde O(1)$ time whether $t$ is reachable from $s$ in the graph $G\setminus
Externí odkaz:
http://arxiv.org/abs/2307.07222