Zobrazeno 1 - 10
of 20 132
pro vyhledávání: '"Czech, A"'
Autor:
Elsner, Tim, Usinger, Paula, Nehring-Wirxel, Julius, Kobsik, Gregor, Czech, Victor, He, Yanjiang, Lim, Isaak, Kobbelt, Leif
In language processing, transformers benefit greatly from text being condensed. This is achieved through a larger vocabulary that captures word fragments instead of plain characters. This is often done with Byte Pair Encoding. In the context of image
Externí odkaz:
http://arxiv.org/abs/2411.10281
Autor:
Heywood, Ian, Siemion, Andrew P. V., Czech, Daniel, Ertel, Steve, Drew, Jamie, Grattan, Kyran, Wagner, Kevin, Worden, S. Pete
Publikováno v:
Res. Notes AAS 8 255, 2024
We have conducted observations of the nearby (11.46 ly) star system Procyon, using MeerKAT's UHF (544-1087 MHz) receivers. We produce full-Stokes time and frequency integrated continuum images, as well as total intensity time series imaging at 8 s ca
Externí odkaz:
http://arxiv.org/abs/2410.15069
Autor:
Adamczyk, Jakub, Czech, Wojciech
We revisit the effectiveness of topological descriptors for molecular graph classification and design a simple, yet strong baseline. We demonstrate that a simple approach to feature engineering - employing histogram aggregation of edge descriptors an
Externí odkaz:
http://arxiv.org/abs/2407.12136
Autor:
Elsner, Tim, Usinger, Paula, Czech, Victor, Kobsik, Gregor, He, Yanjiang, Lim, Isaak, Kobbelt, Leif
In quantised autoencoders, images are usually split into local patches, each encoded by one token. This representation is redundant in the sense that the same number of tokens is spend per region, regardless of the visual information content in that
Externí odkaz:
http://arxiv.org/abs/2407.11913
This paper presents a new approach that integrates deep learning with computational chess, using both the Mixture of Experts (MoE) method and Monte-Carlo Tree Search (MCTS). Our methodology employs a suite of specialized models, each designed to resp
Externí odkaz:
http://arxiv.org/abs/2401.16852
Publikováno v:
SciPost Phys. 17, 084 (2024)
We verify that the recently proven infinite families of holographic entropy inequalities are maximally tight, i.e. they are facets of the holographic entropy cone. The proof is technical but it offers some heuristic insight. On star graphs, both fami
Externí odkaz:
http://arxiv.org/abs/2401.13029
Autor:
Czech, Andreas
Carsharing kann wesentlich zur Reduzierung privater PKW beitragen. Dennoch verharrt es in der Nische. Die vorliegende Arbeit sucht nach den Gründen des Nischendaseins und dies mit Fokus auf unterschiedliche Stakeholdergruppen. Neben der Darstellung
Externí odkaz:
https://library.oapen.org/handle/20.500.12657/63085
Autor:
Choza, Carmen, Bautista, Daniel, Croft, Steve, Brzycki, Bryan, Siemion, Andrew, Bhattaram, Krishnakumar, Czech, Daniel, de Pater, Imke, Gajjar, Vishal, Isaacson, Howard, Lacker, Kevin, Lacki, Brian, Lebofsky, Matthew, MacMahon, David H. E., Price, Danny, Schoultz, Sarah, Sheikh, Sofia, Varghese, Savin Shynu, Morgan, Lawrence, Drew, Jamie, Worden, S. Pete
Publikováno v:
AJ 167 10 (2024)
The Breakthrough Listen search for intelligent life is, to date, the most extensive technosignature search of nearby celestial objects. We present a radio technosignature search of the centers of 97 nearby galaxies, observed by Breakthrough Listen at
Externí odkaz:
http://arxiv.org/abs/2312.03943
Seam carving is an image editing method that enable content-aware resizing, including operations like removing objects. However, the seam-finding strategy based on dynamic programming or graph-cut limits its applications to broader visual data format
Externí odkaz:
http://arxiv.org/abs/2311.13297
We revisit information retrieval from evaporating black holes in the Hayden-Preskill protocol, treating the black hole dynamics as Haar-random. We compute, down to the first exponentially suppressed terms, all integer-indexed R\'enyi mutual informati
Externí odkaz:
http://arxiv.org/abs/2310.16988