Search Results - "Vaccaro, Ugo"

Entropic Bounds on the Average Length of Codes with a Space by Bruno, Roberto, Vaccaro, Ugo

“…We consider the problem of constructing prefix-free codes in which a designated symbol, a , can only appear at the end of codewords. We provide a linear-time…”
Get full text

A note on equivalent conditions for majorization by Bruno, Roberto, Vaccaro, Ugo

“…In this paper, we introduced novel characterizations of the classical concept of majorization in terms of upper triangular (resp., lower triangular)…”
Get full text

Latency-bounded target set selection in social networks by Cicalese, Ferdinando, Cordasco, Gennaro, Gargano, Luisa, Milanič, Martin, Vaccaro, Ugo

“…Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and…”
Get full text

On the approximability and exact algorithms for vector domination and related problems in graphs by Cicalese, Ferdinando, Milanič, Martin, Vaccaro, Ugo

“…We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices…”
Get full text

Bounds and algorithms for generalized superimposed codes by Rescigno, Adele A., Vaccaro, Ugo

“…We introduce a class of generalized superimposed codes that include several cases already studied in the literature. We give bounds on their size and…”
Get full text

Perfectly Secure Key Distribution for Dynamic Conferences by Blundo, Carlo, De Santis, Alfredo, Herzberg, Amir, Kutten, Shay, Vaccaro, Ugo, Yung, Moti

“…In this paper we analyze perfectly secure key distribution schemes for dynamic conferences. In this setting,anymember of a group oftusers can compute a common…”
Get full text

Minimum-Entropy Couplings and Their Applications by Cicalese, Ferdinando, Gargano, Luisa, Vaccaro, Ugo

“…Given two discrete random variables <inline-formula> <tex-math notation="LaTeX">X </tex-math></inline-formula> and <inline-formula> <tex-math…”
Get full text

Bounds on the Entropy of a Function of a Random Variable and Their Applications by Cicalese, Ferdinando, Gargano, Luisa, Vaccaro, Ugo

“…It is well known that the entropy <inline-formula> <tex-math notation="LaTeX">H(X) </tex-math></inline-formula> of a discrete random variable <inline-formula>…”
Get full text

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees by Bruno, Roberto, De Prisco, Roberto, De Santis, Alfredo, Vaccaro, Ugo

“…Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions…”
Get full text

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

Improved Algorithms and Bounds for List Union-Free Families by Rescigno, Adele A., Vaccaro, Ugo

“…List union-free families are basic combinatorial structures that appear in different application scenarios, most notably in one-bit compressed sensing. In this…”
Get full text

An efficient algorithm for group testing with runlength constraints by Dalai, Marco, Della Fiore, Stefano, Rescigno, Adele A., Vaccaro, Ugo

“…In this paper, we provide an efficient algorithm to construct almost optimal (k,n,d)-superimposed codes with runlength constraints. A (k,n,d)-superimposed code…”
Get full text

Evangelism in social networks: Algorithms and complexity by Cordasco, Gennaro, Gargano, Luisa, Rescigno, Adele Anna, Vaccaro, Ugo

“…We consider a population of interconnected individuals that, with respect to a piece of information, at each time instant can be subdivided into three…”
Get full text

Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm by Cordasco, Gennaro, Gargano, Luisa, Mecchia, Marco, Rescigno, Adele A., Vaccaro, Ugo

“…Given a network represented by a graph G = ( V , E ) , we consider a dynamical process of influence diffusion in G that evolves as follows: Initially only the…”
Get full text

Spread of influence in weighted networks under time and budget constraints by Cicalese, Ferdinando, Cordasco, Gennaro, Gargano, Luisa, Milanič, Martin, Peters, Joseph, Vaccaro, Ugo

“…Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading…”
Get full text

Influence diffusion in social networks under time window constraints by Gargano, Luisa, Hell, Pavol, Peters, Joseph G., Vaccaro, Ugo

“…We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model,…”
Get full text

On the information rate of secret sharing schemes by Blundo, Carlo, De Santis, Alfredo, Gargano, Luisa, Vaccaro, Ugo

“…We derive new limitations on the information rate and the average information rate of secret sharing schemes for access structure represented by graphs. We…”
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

Android Malware Detection Based on Hypergraph Neural Networks by Zhang, Dehua, Wu, Xiangbo, He, Erlu, Guo, Xiaobo, Yang, Xiaopeng, Li, Ruibo, Li, Hao

“…Android has been the most widely used operating system for mobile phones over the past few years. Malicious attacks against android are a major privacy and…”
Get full text

A Note on Equivalent Conditions for Majorization by Bruno, Roberto, Vaccaro, Ugo

“…AIMS Mathematics 2024, 9(4), 8641-8660 In this paper, we introduce novel characterizations of the classical concept of majorization in terms of upper…”
Get full text