1 code implementation • 17 Nov 2023 • Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, Alexandru I. Tomescu
Given a flow network, the Minimum Flow Decomposition (MFD) problem is finding the smallest possible set of weighted paths whose superposition equals the flow.
no code implementations • 24 Aug 2019 • Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo, Romeo Rizzi
In many applications, a sentinel character dollar is added to mark the end of the string, and thus the BWT of a string ending with dollar contains exactly one dollar-character.
Data Structures and Algorithms
no code implementations • 30 Nov 2015 • Massimo Cairo, Gabriele Farina, Romeo Rizzi
In this paper, we present a novel algorithm for the maximum a posteriori decoding (MAPD) of time-homogeneous Hidden Markov Models (HMM), improving the worst-case running time of the classical Viterbi algorithm by a logarithmic factor.
no code implementations • 4 May 2015 • Carlo Comin, Romeo Rizzi
The presentation of such connection is mediated by the Hyper Temporal Network model, a tractable generalization of Simple Temporal Networks whose consistency checking is equivalent to determining Mean Payoff Games.
no code implementations • 13 Mar 2015 • Carlo Comin, Roberto Posenato, Romeo Rizzi
Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables.
