Search Results - "de Bonis, Annalisa"

epsilon -Almost Selectors and Their Applications to Multiple-Access Communication by De Bonis, Annalisa, Vaccaro, Ugo

“…Consider a group of stations connected through a multiple-access channel, with the constraint that if at a time instant exactly one station transmits a…”
Get full text

Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing by 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…”
Get full text

Partial Covering Arrays: Algorithms and Asymptotics by Sarkar, Kaushik, Colbourn, Charles J., De Bonis, Annalisa, Vaccaro, Ugo

“…A covering array CA( N ; t , k , v ) is an N × k array with entries in {1,2,…, v }, for which every N × t subarray contains each t -tuple of {1,2,…, v } t…”
Get full text

Improved bounds for group testing in arbitrary hypergraphs by 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)…”
Get full text

Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures by 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…”
Get full text

New combinatorial structures with applications to efficient group testing with inhibitors by De Bonis, Annalisa

“…Group testing with inhibitors (GTI) is a variant of classical group testing where in addition to positive items and negative items, there is a third class of…”
Get full text

An almost optimal algorithm for generalized threshold group testing with inhibitors by Chen, Hong-Bin, De Bonis, Annalisa

“…Group testing is a search paradigm where one is given a population S of n elements and an P is a subset of S defective elements and the goal is to determine P…”
Get more information

Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels by De Bonis, Annalisa, Vaccaro, Ugo

“…In this paper we introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their construction and provide…”
Get full text

Efficient algorithms for chemical threshold testing problems by Bonis, Annalisa De, Gargano, Luisa, Vaccaro, Ugo

“…We consider a generalization of the classical group testing problem. Let us be given a sample contaminated with a chemical substance. We want to estimate the…”
Get full text

Largest family without A ∪ B ⊆ C ∩ D by De Bonis, Annalisa, Katona, Gyula O.H., Swanepoel, Konrad J.

“…Let F be a family of subsets of an n-element set not containing four distinct members such that A ∪ B ⊆ C ∩ D . It is proved that the maximum size of F under…”
Get full text

Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes by De Bonis, A., Vaccaro, U.

“…Two variants of the well-known group testing problem are considered. In the first variant a finite set of items O and an unknown subset PsubeO are given, and…”
Get full text

Largest Families Without an r-Fork by De Bonis, Annalisa, Katona, Gyula O. H.

Get full text

Randomness in secret sharing and visual cryptography schemes by De Bonis, Annalisa, De Santis, Alfredo

“…Secret sharing schemes allow a secret to be shared among a group of participants so that only qualified subsets of participants can recover the secret. A…”
Get full text

Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions by 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…”
Get full text

Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing by 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…”
Get full text

Improved algorithms for group testing with inhibitors by De Bonis, Annalisa, Vaccaro, Ugo

“…Recent biological applications motivate a new group testing model where in addition to the category of the positive samples and the one of the negative…”
Get full text

Partial Covering Arrays: Algorithms and Asymptotics by Sarkar, Kaushik, Colbourn, Charles J, De Bonis, Annalisa, Vaccaro, Ugo

“…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…”
Get full text

A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance by De Bonis, Annalisa

“…We consider the classical problem of searching a light coin in a set of n coins, n − 1 of which have the same weight. The weighing device is a balance scale…”
Get full text

Group testing with unreliable tests by de Bonis, Annalisa, Gargano, Luisa, Vaccaro, Ugo

“…We consider the problem of locating two unknown elements x, y using group testing devices. Assuming that up to a given number E of tests out of Q can give…”
Get full text

New combinatorial structures with applications to efficient group testing with inhibitors: Group testing and applications by DE BONIS, Annalisa

Get full text