Seminars

you must be logged-in to have full access to seminar attachments

Ph.D. thesis defense

Date: 
3 March, 2011 - 14:30 - 17:40
Location: 
Aula Multimediale DIMI
Description
Abstract: 

Paolo Casoto, Raffaele Cipriano, Dario Della Monica, Asha Rani, and Luca Vassena will defend their Ph.D. thesis.

DEFENSE SCHEDULE:

[14:30 - 15:00] Asha Rani
"New Aspects of Neural Tree Based Classifiers for Pattern Recognition"
[15:10 - 15:40] Dario Della Monica
"Expressiveness, decidability, and undecidability of Interval Temporal Logic"
[15:50 - 16:20] Luca Vassena
"Context-aware retrieval for mobile devices: a tale of three systems"
[16:30 - 17:00] Raffaele Cipriano
"On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools"
[17:10 - 17:40] Paolo Casoto
"Sentiment Analysis for the Italian Language"

Excluding induced subgraphs

Date: 
25 January, 2011 - 11:00 - 11:40
Location: 
Sala riunioni DIMI
Description
Abstract: 

In this talk we review some classical results obtained by excluding induced subgraphs.

This talk is based on a course attended at the First Montreal Spring School in Graph Theory, May 2010.

The synthesis problem for real-time specifications

Date: 
9 December, 2010 - 16:30 - 17:00
Location: 
Sala riunioni DIEGM
Description
Abstract: 

The talk presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words. More precisely, we introduce Safraless procedures for computing the complement of an alternating event-clock automaton with Büchi acceptance condition, and solving timed games whose objectives are specified by Past alternating event clock automata with co-Büchi acceptance condition.

We apply the latter algorithm to solve the realizability problem for LTL-past, a fragment of ECL with past operators only. We show how our techniques can be used to reduce this problem to solving a sequence of timed safety games, which can be done in practice thanks to tools such as UppAal TiGa.

Graphs of small separability

Date: 
6 December, 2010 - 11:45 - 12:30
Location: 
Sala Riunioni
Description
Abstract: 

Graphs of separability at most k are defined as graphs in which every two non-adjacent vertices are separated by a set of at most k other vertices. For k=0 or k = 1, the only connected graphs of separability at most k are complete graphs and block graphs, respectively. For values of k greater than 2, graphs of separability at most k form a rich class of graphs containing all graphs of maximum degree k. Graphs of separability at most 2 generalize complete graphs, cycles and trees.

In this talk, we will discuss several characterizations of graphs of separability at most 2 and examine some of their consequences. We will also outline the connection between graphs of bounded separability and the parsimony haplotyping problem from computational biology.

The talk is based on joint work with Ferdinando Cicalese.

Syndicate content