Zobrazeno 1 - 10
of 7 606
pro vyhledávání: '"P, Weisser"'
Autor:
Sandra Folie
Publikováno v:
Genealogy+Critique, Vol 9, Iss 1 (2023)
In Tete Loeper's novel Barefoot in Germany (2020), Black first-person narrator Mutoni from Rwanda recounts her experiences as a marriage migrant, sex worker, maid, and caregiver in Germany, a supposed "Happyland" where racism is considered the offens
Externí odkaz:
https://doaj.org/article/7714df7126e5477f820495972729fa60
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.
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:
Thielmann, Anton Frederik, Kumar, Manish, Weisser, Christoph, Reuter, Arik, Säfken, Benjamin, Samiee, Soheila
The analysis of tabular data has traditionally been dominated by gradient-boosted decision trees (GBDTs), known for their proficiency with mixed categorical and numerical features. However, recent deep learning innovations are challenging this domina
Externí odkaz:
http://arxiv.org/abs/2408.06291
Autor:
Semnani, Parastoo, Bogojeski, Mihail, Bley, Florian, Zhang, Zizheng, Wu, Qiong, Kneib, Thomas, Herrmann, Jan, Weisser, Christoph, Patcas, Florina, Müller, Klaus-Robert
The successful application of machine learning (ML) in catalyst design relies on high-quality and diverse data to ensure effective generalization to novel compositions, thereby aiding in catalyst discovery. However, due to complex interactions, catal
Externí odkaz:
http://arxiv.org/abs/2407.18935
A line digraph $L(G) = (A, E)$ is the digraph constructed from the digraph $G = (V, A)$ such that there is an arc $(a,b)$ in $L(G)$ if the terminal node of $a$ in $G$ is the initial node of $b$. The maximum number of arcs in a line digraph with $m$ n
Externí odkaz:
http://arxiv.org/abs/2406.05141
We address a specific case of the matroid intersection problem: given a set of graphs sharing the same set of vertices, select a minimum cycle basis for each graph to maximize the size of their intersection. We provide a comprehensive complexity anal
Externí odkaz:
http://arxiv.org/abs/2404.17223
Topic modelling was mostly dominated by Bayesian graphical models during the last decade. With the rise of transformers in Natural Language Processing, however, several successful models that rely on straightforward clustering approaches in transform
Externí odkaz:
http://arxiv.org/abs/2403.03737
Topic modeling seems to be almost synonymous with generating lists of top words to represent topics within large text corpora. However, deducing a topic from such list of individual terms can require substantial expertise and experience, making topic
Externí odkaz:
http://arxiv.org/abs/2403.03628
Autor:
Robert Hannah
Publikováno v:
Aestimatio, Vol 14, Pp 22-26 (2019)
Externí odkaz:
https://doaj.org/article/a9c5b06390f14b22b11ac600245bdf33