66 citations · 204 across the 20 of their papers we have counts for
12 papers · 1 filter
Information theoretical clustering is hard to approximate
Ferdinando Cicalese, Eduardo Laber
An impurity measures is a function that assigns a -dimensional vector to a non-negative value so that the more homo…
Approximation Algorithms for Clustering via Weighted Impurity Measures
Ferdinando Cicalese, Eduardo Laber
An impurity measures maps a -dimensional vector to a non-negative value so that the more homogeneous , the larger its impurit…
Bubble-Flip -- A New Generation Algorithm for Prefix Normal Words
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
We present a new recursive generation algorithm for prefix normal words. These are binary strings with the property that no substring has more 1s than the prefix of the same length…
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution
Wilfredo Bardales Roncalla, Eduardo Laber, Ferdinando Cicalese
Given a sequence of n numbers, the Maximum Consecutive Subsums Problem (MCSP) asks for the maximum consecutive sum of lengths l for each l = 1,...,n. No algorithm is known for this…
On the Tree Search Problem with Non-uniform Costs
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický +2
Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge repre…
Decision Trees for Function Evaluation - Simultaneous Optimization of Worst and Expected Cost
Ferdinando Cicalese, Eduardo Laber, Aline Medeiros Saettler
In several applications of automatic diagnosis and active learning a central problem is the evaluation of a discrete function by adaptively querying the values of its variables unt…