Zobrazeno 1 - 10
of 1 039
pro vyhledávání: '"Pham, Huy P"'
Recovering a low-complexity signal from its noisy observations by regularization methods is a cornerstone of inverse problems and compressed sensing. Stable recovery ensures that the original signal can be approximated linearly by optimal solutions o
Externí odkaz:
http://arxiv.org/abs/2412.11313
Autor:
Pham, Huy Tuan
Expectation thresholds arise from a class of integer linear programs (LPs) that are fundamental to the study of thresholds in large random systems. An avenue towards estimating expectation thresholds comes from the fractional relaxation of these inte
Externí odkaz:
http://arxiv.org/abs/2412.03540
Autor:
Nguyen, Dac Thai, Nguyen, Trung Thanh, Nguyen, Huu Tien, Nguyen, Thanh Trung, Pham, Huy Hieu, Nguyen, Thanh Hung, Truong, Thao Nguyen, Nguyen, Phi Le
Positron Emission Tomography (PET) and Computed Tomography (CT) are essential for diagnosing, staging, and monitoring various diseases, particularly cancer. Despite their importance, the use of PET/CT systems is limited by the necessity for radioacti
Externí odkaz:
http://arxiv.org/abs/2410.21932
Autor:
Pham, Huy Tuan, Zakharov, Dmitrii
A set of integers $A$ is non-averaging if there is no element $a$ in $A$ which can be written as an average of a subset of $A$ not containing $a$. We show that the largest non-averaging subset of $\{1, \ldots, n\}$ has size $n^{1/4+o(1)}$, thus solvi
Externí odkaz:
http://arxiv.org/abs/2410.14624
We study the number of monochromatic solutions to linear equations in a $2$-coloring of $\{1,\ldots,n\}$. We show that any nontrivial linear equation has a constant fraction of solutions that are monochromatic in any $2$-coloring of $\{1,\ldots,n\}$.
Externí odkaz:
http://arxiv.org/abs/2410.13758
Autor:
Nenadov, Rajko, Pham, Huy Tuan
Combining ideas of Pham, Sah, Sawhney, and Simkin on spread perfect matchings in super-regular bipartite graphs with an algorithmic blow-up lemma, we prove a spread version of the blow-up lemma. Intuitively, this means that there exists a probability
Externí odkaz:
http://arxiv.org/abs/2410.06132
Autor:
Nguyen, Manh Duong, Nguyen, Trung Thanh, Pham, Huy Hieu, Hoang, Trong Nghia, Nguyen, Phi Le, Huynh, Thanh Trung
Federated Learning (FL) is a method for training machine learning models using distributed data sources. It ensures privacy by allowing clients to collaboratively learn a shared global model while storing their data locally. However, a significant ch
Externí odkaz:
http://arxiv.org/abs/2410.03070
Autor:
Nenadov, Rajko, Pham, Huy Tuan
We present a short and simple proof of the celebrated hypergraph container theorem of Balogh--Morris--Samotij and Saxton--Thomason. On a high level, our argument utilises the idea of iteratively taking vertices of largest degree from an independent s
Externí odkaz:
http://arxiv.org/abs/2408.08514
A family of $r$ distinct sets $\{A_1,\ldots, A_r\}$ is an $r$-sunflower if for all $1 \leqslant i < j \leqslant r$ and $1 \leqslant i' < j' \leqslant r$, we have $A_i \cap A_j = A_{i'} \cap A_{j'}$. Erd\H{o}s and Rado conjectured in 1960 that every f
Externí odkaz:
http://arxiv.org/abs/2408.04165
Conditional video diffusion models (CDM) have shown promising results for video synthesis, potentially enabling the generation of realistic echocardiograms to address the problem of data scarcity. However, current CDMs require a paired segmentation m
Externí odkaz:
http://arxiv.org/abs/2408.03035