Zobrazeno 1 - 10
of 8 777
pro vyhledávání: '"P, Tompkins"'
We study the challenge of predicting the time at which a competitor product, such as a novel high-capacity EV battery or a new car model, will be available to customers; as new information is obtained, this time-to-market estimate is revised. Our sce
Externí odkaz:
http://arxiv.org/abs/2411.04266
Binary Code Similarity Analysis (BCSA) has a wide spectrum of applications, including plagiarism detection, vulnerability discovery, and malware analysis, thus drawing significant attention from the security community. However, conventional technique
Externí odkaz:
http://arxiv.org/abs/2410.10163
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. We consider the analogous Tur\'{a}n problems on hypergraphs with bounded matching number, and we
Externí odkaz:
http://arxiv.org/abs/2410.07455
Autor:
Barron, Ryan C., Grantcharov, Ves, Wanna, Selma, Eren, Maksim E., Bhattarai, Manish, Solovyev, Nicholas, Tompkins, George, Nicholas, Charles, Rasmussen, Kim Ø., Matuszek, Cynthia, Alexandrov, Boian S.
Large Language Models (LLMs) are pre-trained on large-scale corpora and excel in numerous general natural language processing (NLP) tasks, such as question answering (QA). Despite their advanced language capabilities, when it comes to domain-specific
Externí odkaz:
http://arxiv.org/abs/2410.02721
Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an $n$-vertex connected $r$-uniform hypergraph which contains no member of $\mathcal{F}$ as a subhypergraph
Externí odkaz:
http://arxiv.org/abs/2409.03323
Autor:
Wu, Haibin, Wang, Xiaofei, Eskimez, Sefik Emre, Thakker, Manthan, Tompkins, Daniel, Tsai, Chung-Hsien, Li, Canrun, Xiao, Zhen, Zhao, Sheng, Li, Jinyu, Kanda, Naoyuki
People change their tones of voice, often accompanied by nonverbal vocalizations (NVs) such as laughter and cries, to convey rich emotions. However, most text-to-speech (TTS) systems lack the capability to generate speech with rich emotions, includin
Externí odkaz:
http://arxiv.org/abs/2407.12229
Many observational studies feature irregular longitudinal data, where the observation times are not common across individuals in the study. Further, the observation times may be related to the longitudinal outcome. In this setting, failing to account
Externí odkaz:
http://arxiv.org/abs/2405.15740
Autor:
Hansen, Samuel P., Lagos, Claudia D. P., Bonato, Matteo, Cook, Robin H. W., Davies, Luke J. M., Delvecchio, Ivan, Tompkins, Scott A.
We present a model of radio continuum emission associated with star formation (SF) and active galactic nuclei (AGN) implemented in the Shark semi-analytic model of galaxy formation. SF emission includes free-free and synchrotron emission, which depen
Externí odkaz:
http://arxiv.org/abs/2405.05586
Bollob\'as proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of
Externí odkaz:
http://arxiv.org/abs/2312.09999
Autor:
Allaire, Corentin, Garg, Rocky Bala, Grasland, Hadrien Benjamin, Hofgard, Elyssa Frances, Rousseau, David, Salahat, Rama, Salzburger, Andreas, Tompkins, Lauren Alexandra
The reconstruction of charged particle trajectories is a crucial challenge of particle physics experiments as it directly impacts particle reconstruction and physics performances. To reconstruct these trajectories, different reconstruction algorithms
Externí odkaz:
http://arxiv.org/abs/2312.05123