Zobrazeno 1 - 10
of 4 175
pro vyhledávání: '"Hoffmann Michael"'
Recent advancements in Large Language Models (LLMs) like ChatGPT and GPT-4 have shown remarkable abilities in a wide range of tasks such as summarizing texts and assisting in coding. Scientific research has demonstrated that these models can also pla
Externí odkaz:
http://arxiv.org/abs/2410.20536
Autor:
Bekos, Michael A., Bose, Prosenjit, Büngener, Aaron, Dujmović, Vida, Hoffmann, Michael, Kaufmann, Michael, Morin, Pat, Odak, Saeed, Weinberger, Alexandra
We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to which the fo
Externí odkaz:
http://arxiv.org/abs/2408.16085
We show that every planar graph has a monotone topological 2-page book embedding where at most (4n-10)/5 (of potentially 3n-6) edges cross the spine, and every edge crosses the spine at most once; such an edge is called a biarc. We can also guarantee
Externí odkaz:
http://arxiv.org/abs/2408.14299
In May 2023, the Georgia Tech Ethics, Technology, and Human Interaction Center organized the Conference on Ethical and Responsible Design in the National AI Institutes. Representatives from the National AI Research Institutes that had been establishe
Externí odkaz:
http://arxiv.org/abs/2407.13926
HfO$_2$- and ZrO$_2$-based ferroelectric thin films have emerged as promising candidates for the gate oxides of next generation electronic devices. Recent work has experimentally demonstrated that a tetragonal/orthorhombic (t/o-) phase mixture with p
Externí odkaz:
http://arxiv.org/abs/2402.05331
Given a set of objects O in the plane, the corresponding intersection graph is defined as follows. A vertex is created for each object and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit segment
Externí odkaz:
http://arxiv.org/abs/2401.02172