Zobrazeno 1 - 10
of 9 270
pro vyhledávání: '"Dvořák, P."'
Retrieval Augmented Generation (RAG) enables Large Language Models (LLMs) to generalize to new information by decoupling reasoning capabilities from static knowledge bases. Traditional RAG enhancements have explored vertical scaling -- assigning subt
Externí odkaz:
http://arxiv.org/abs/2412.06832
Autor:
Vernetto, Silvia, Vigorito, Carlo Francesco, Kakona, Martin, Dvorak, Roman, Kodaira, Satoshi, Cirilli, Stefano, Romanelli, Fabio, Savietto, Daniele, Zanini, Alba
This paper describes the performance of the LABDOS01, a silicon diode-based spectrometer suitable for dose measurements in mixed radiation fields. The instrument is currently being used in two high-altitude environmental dose monitoring projects: SAM
Externí odkaz:
http://arxiv.org/abs/2412.01515
Autor:
Dvorak, Martin, Kolmogorov, Vladimir
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered
Externí odkaz:
http://arxiv.org/abs/2409.08119
We study semidefinite relaxations of $\Pi_1$ combinatorial statements. By relaxing the pigeonhole principle, we obtain a new "quantum" pigeonhole principle which is a stronger statement. By relaxing statements of the form "the communication complexit
Externí odkaz:
http://arxiv.org/abs/2409.04592
Autor:
Tampo, Yusuke, Kato, Taichi, Isogai, Keisuke, Kimura, Mariko, Kojiguchi, Naoto, Nogami, Daisaku, Ito, Junpei, Shibata, Masaaki, Yamanaka, Masayuki, Taguchi, Kenta, Maehara, Hiroyuki, Itoh, Hiroshi, Matsumoto, Katsura, Nakagawa, Momoka, Nishida, Yukitaka, Dvorak, Shawn, Murata, Katsuhiro L., Hosokawa, Ryohei, Imai, Yuri, Ito, Naohiro, Niwano, Masafumi, Sato, Shota, Noto, Ryotaro, Yamaguchi, Ryodai, Schramm, Malte, Oasa, Yumiko, Kanai, Takahiro, Sasaki, Yu, Tordai, Tamás, Vanmunster, Tonny, Kiyota, Seiichiro, Katysheva, Nataly, Shugarov, Sergey Yu., Zubareva, Alexandra M., Antipin, Sergei, Ikonnikova, Natalia, Belinski, Alexandr, Dubovsky, Pavol A., Medulka, Tomáš, Takahashi, Jun, Takayama, Masaki, Ohshima, Tomohito, Saito, Tomoki, Tozuka, Miyako, Sako, Shigeyuki, Tanaka, Masaomi, Tominaga, Nozomu, Horiuchi, Takashi, Hanayama, Hidekazu, Reichart, Daniel E., Kouprianov, Vladimir V., Davidson Jr, James W., Caton, Daniel B., Romanov, Filipp D., Lane, David J., Hambsch, Franz-josef, Narita, Norio, Fukui, Akihiko, Ikoma, Masahiro, Tamura, Motohide, Kawabata, Koji S., Nakaoka, Tatsuya, Imazawa, Ryo
We present a detailed study of the MASTER OT J030227.28+191754.5 outburst in 2021-2022, reaching an amplitude of 10.2 mag and a duration of 60 d. The detections of (1) the double-peaked optical emission lines, and (2) the early and ordinary superhump
Externí odkaz:
http://arxiv.org/abs/2408.13783
Through computer-assisted enumeration, we list minimal obstructions for 5-choosability of graphs on the torus with the following additional property: There exists a cyclic system of non-contractible triangles around the torus where the consecutive tr
Externí odkaz:
http://arxiv.org/abs/2407.18800
Time-varying connectivity of triangle mesh sequences leads to substantial difficulties in their processing. Unlike editing sequences with constant connectivity, editing sequences with varying connectivity requires addressing the problem of temporal c
Externí odkaz:
http://arxiv.org/abs/2405.04957
Autor:
Alt, Benjamin, Zahn, Johannes, Kienle, Claudius, Dvorak, Julia, May, Marvin, Katic, Darko, Jäkel, Rainer, Kopp, Tobias, Beetz, Michael, Lanza, Gisela
While recent advances in deep learning have demonstrated its transformative potential, its adoption for real-world manufacturing applications remains limited. We present an Explanation User Interface (XUI) for a state-of-the-art deep learning-based r
Externí odkaz:
http://arxiv.org/abs/2404.19349
Over the past decade, deep learning helped solve manipulation problems across all domains of robotics. At the same time, industrial robots continue to be programmed overwhelmingly using traditional program representations and interfaces. This paper u
Externí odkaz:
http://arxiv.org/abs/2404.13652
Autor:
Dvořák, Zdeněk, Norin, Sergey
A connected graph G is 3-flow-critical if G does not have a nowhere-zero 3-flow, but every proper contraction of G does. We prove that every n-vertex 3-flow-critical graph other than K_2 and K_4 has at least 5n/3 edges. This bound is tight up to lowe
Externí odkaz:
http://arxiv.org/abs/2404.00324