Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Mahdi Cheraghchi"'
Autor:
Ananthan Nambiar, Chao Pan, Vishal Rana, Mahdi Cheraghchi, João Ribeiro, Sergei Maslov, Olgica Milenkovic
Publikováno v:
BMC Bioinformatics, Vol 25, Iss 1, Pp 1-18 (2024)
Abstract Background Pathogenic infections pose a significant threat to global health, affecting millions of people every year and presenting substantial challenges to healthcare systems worldwide. Efficient and timely testing plays a critical role in
Externí odkaz:
https://doaj.org/article/1fa424b906b64899824acff29912accf
Publikováno v:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing.
Publikováno v:
ISIT
The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at least $u$ defe
Publikováno v:
Theory of Computing Systems.
For a size parameter s: ℕ → ℕ, the Minimum Circuit Size Problem (denoted by MCSP[s(n)]) is the problem of deciding whether the minimum circuit size of a given function f : {0,1}ⁿ → {0,1} (represented by a string of length N : = 2ⁿ) is at
Publikováno v:
ACM Transactions on Computation Theory. 12:1-27
The Minimum Circuit Size Problem (MCSP) asks if a given truth table of a Boolean function f can be computed by a Boolean circuit of size at most θ, for a given parameter θ. We improve several circuit lower bounds for MCSP, using pseudorandom genera
Autor:
João Ribeiro, Mahdi Cheraghchi
Publikováno v:
Allerton
We study natural examples of binary channels with synchronization errors. These include the duplication channel, which independently outputs a given bit once or twice, and geometric channels that repeat a given bit according to a geometric rule, with
Publikováno v:
ISIT
Mean-based reconstruction is a fundamental, natural approach to worst-case trace reconstruction over channels with synchronization errors. It is known that $\exp(O(n^{1/3}))$ traces are necessary and sufficient for mean-based worst-case trace reconst
Publikováno v:
ISIT
The goal of group testing is to efficiently identify a few specific items, called positives, in a large population of items via tests. A test is an action on a subset of items that returns positive if the subset contains at least one positive and neg
Publikováno v:
IEEE International Symposium on Information Theory (ISIT)
ISIT
ISIT
We consider non-adaptive threshold group testing for identification of up to $d$ defective items in a set of $n$ items, where a test is positive if it contains at least $2 \leq u \leq d$ defective items, and negative otherwise. The defective items ca
Autor:
Mahdi Cheraghchi
Publikováno v:
IEEE Transactions on Information Theory. 65:3999-4009
We develop a general method for computing logarithmic and log-gamma expectations of distributions. As a result, we derive series expansions and integral representations of the entropy for several fundamental distributions, including the Poisson, bino