Oct 5, 2010 · We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, ...

We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing ...

We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing ...

Ferdinando Cicalese, Ugo Vaccaro: Superselectors: Efficient Constructions and Applications. CoRR abs/1010.1024 (2010). manage site settings.

https://dblp.org/rec/conf/esa/CicaleseV10 · Ferdinando Cicalese, Ugo Vaccaro: Superselectors: Efficient Constructions and Applications. ESA (1) 2010: 207-218.

Nov 8, 2010 · Naslov: Superselectors: Efficient Constructions and Applications Povzetek: Superimposed codes represent the main tool for the efficient ...

We prove close upper and lower bounds on the size of superselectors and we provide efficient algorithms for their constructions. Albeit our bounds are very ...

DS) [pdf, other]. Title: Superselectors: Efficient Constructions and Applications. Ferdinando Cicalese, Ugo Vaccaro. Subjects: Data Structures and Algorithms ...

We introduce a new combinatorial structure: superselectors. We show that superselectors subsume several important combinatorial structures used in the past ...

The generator uses a kind of unique-neighbor expander graphs that are shown to exist using the probabilistic method, but that are not known to be efficiently ...