Zobrazeno 1 - 10
of 69
pro vyhledávání: '"De Bonis, Annalisa"'
Autor:
De Bonis, Annalisa
Recent papers initiated the study of a generalization of group testing where the potentially contaminated sets are the members of a given hypergraph F=(V,E). This generalization finds application in contexts where contaminations can be conditioned by
Externí odkaz:
http://arxiv.org/abs/2404.18783
Autor:
De Bonis, Annalisa
We consider a generalization of group testing where the potentially contaminated sets are the members of a given hypergraph ${\cal F}=(V,E)$. This generalization finds application in contexts where contaminations can be conditioned by some kinds of s
Externí odkaz:
http://arxiv.org/abs/2307.09608
Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing
Autor:
De Bonis, Annalisa
Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find all defectiv
Externí odkaz:
http://arxiv.org/abs/1606.03200
Autor:
De Bonis, Annalisa
We consider the Conflict Resolution Problem in the context of a multiple-access system in which several stations can transmit their messages simultaneously to the channel. We assume that there are n stations and that at most k<= n stations are active
Externí odkaz:
http://arxiv.org/abs/1606.03198
A covering array $\mathsf{CA}(N;t,k,v)$ is an $N\times k$ array with entries in $\{1, 2, \ldots , v\}$, for which every $N\times t$ subarray contains each $t$-tuple of $\{1, 2, \ldots , v\}^t$ among its rows. Covering arrays find application in inter
Externí odkaz:
http://arxiv.org/abs/1605.02131
Publikováno v:
J. Combin. Theory Ser. A 111 (2005), no. 2, 331--336
Let F be a family of subsets of an n-element set not containing four distinct members such that A union B is contained in C intersect D. It is proved that the maximum size of F under this condition is equal to the sum of the two largest binomial coef
Externí odkaz:
http://arxiv.org/abs/math/0407373
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
De Bonis, Annalisa *, De Santis, Alfredo
Publikováno v:
In Theoretical Computer Science 2004 314(3):351-374
Autor:
De Bonis, Annalisa *, Vaccaro, Ugo
Publikováno v:
In Theoretical Computer Science 5 September 2003 306(1-3):223-243