U. Vaccaro

activity

20102023

most citedLatency-Bounded Target Set Selection in Social Networks

66 citations · 109 across the 14 of their papers we have counts for

collaborators

18 papers

cs.IT2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1

In this paper, we study upper bounds on the minimum length of frameproof codes introduced by Boneh and Shaw to protect copyrighted materials. A $q$ -ary $(k, n)$ -frameproof code of l…

cs.IT2022★ 1 cited

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Stefano Della Fiore, Marco Dalai, Ugo Vaccaro

In this paper, we study bounds on the minimum length of $(k, n, d)$ -superimposed codes introduced by Agarwal et al. [1], in the context of Non-Adaptive Group Testing algorithms with…

cs.IT2019

Minimum--Entropy Couplings and their Applications

Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro

Given two discrete random variables $X$ and $Y,$ with probability distributions $p = (p_{1}, \dots, p_{n})$ and $q = (q_{1}, \dots, q_{m})$ , respectively, denote by ${\cal C}({…

cs.DS2018

Time-Bounded Influence Diffusion with Incentives

Gennaro Cordasco, Luisa Gargano, Joseph Peters +2

A widely studied model of influence diffusion in social networks represents the network as a graph $G = (V, E)$ with an influence threshold $t (v)$ for each node. Initially the members…

cs.IT2018

Maximum Entropy Interval Aggregations

Ferdinando Cicalese, Ugo Vaccaro

Given a probability distribution $p = (p_{1}, \dots, p_{n})$ and an integer $1 \leq m < n$ , we say that $q = (q_{1}, \dots, q_{m})$ is a contiguous $m$ -aggregation of $p$ …

cs.IT2017

Bounds on the Entropy of a Function of a Random Variable and their Applications

Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro

It is well known that the entropy $H (X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H (f (X))$ of a function $f$ of $X$ , with equality if and o…