Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
In this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of tasks in a preemptive multi-tasking single-processor real-time system with a set associati...
Several image mosaicing algorithms claiming to advance the state of the art have been proposed so far. Though sometimes improvements can be recognised without quantitative evidence...
Pietro Azzari, Luigi di Stefano, Stefano Mattoccia
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
The ability to accurately judge the similarity between natural language sentences is critical to the performance of several applications such as text mining, question answering, an...