F. Cicalese

activity

20092025

most citedLatency-Bounded Target Set Selection in Social Networks

66 citations · 204 across the 20 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

cs.DS2018

Information theoretical clustering is hard to approximate

Ferdinando Cicalese, Eduardo Laber

An impurity measures $I : R^{d} \mapsto R^{+}$ is a function that assigns a $d$ -dimensional vector $v$ to a non-negative value $I (v)$ so that the more homo…

math.CO2018★ 3 cited

On Infinite Prefix Normal Words

Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi

Prefix normal words are binary words that have no factor with more $1$ s than the prefix of the same length. Finite prefix normal words were introduced in [Fici and Lipták, DLT 2011…

cs.DS2018★ 3 cited

Approximation Algorithms for Clustering via Weighted Impurity Measures

Ferdinando Cicalese, Eduardo Laber

An impurity measures $I : R^{k} \to R^{+}$ maps a $k$ -dimensional vector $v$ to a non-negative value $I (v)$ so that the more homogeneous $v$ , the larger its impurit…

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$ …