Workshop > Invited Speakers

Constraint Programming illustrated on the Subgraph Isomorphism Problem

My Photo

Christine Solnon

 

Short Bio:

Christine Solnon received the Dipl. and Ph.D. degrees in computer science from the University of Nice-Sophia Antipolis, France, in 1989 and 1993, respectively.,Since 1994, she has been an Associate Professor with the Computer Science Department, University Claude Bernard, Lyon, France. Her current research interests include ant algorithms, constraint satisfaction problems, and solvers cooperation. Her previous research interests include type inference systems and the static analysis of Prolog programs

Abstract:

According to Gene Freuder, Constraint Programming (CP) represents one of the closest approaches computer science has yet made to the Holy Grail of programming: the user states the problem, the computer solves it. Problems are modelled by means of constraints using high level languages, and they are solved by generic solvers. In this talk, we'll illustrate CP through a problem which is at the core of many pattern recognition tasks, i.e., subgraph isomorphism (SI). In particular, we’ll see how to model and solve SI with existing CP libraries. We’ll also describe various ingredients used by generic CP solvers, such as constraint propagation, ordering heuristics, restarts and no-good learning, and evaluate their practical interest for solving SI.

 

Graphs and ML

My Photo

 Fragkiskos Malliaros

 

Short Bio:

Associate Professor (HDR) at CentraleSupélec, Paris-Saclay University, Fragkiskos Malliaros is working in the Center for Visual Computing, and the OPIS team of Inria Saclay. My research interests span the broad area of data science, with focus on graph mining, social network analysis, applied machine learning and natural language processing.

Right before that, he spent a wonderful year as a data science postdoctoral fellow in the Department of Computer Science and Engineering at UC San Diego, where he was a member of the Artificial Intelligence group. He was also affiliated with the Information Theory and Applications Center (ITA) and the Qualcomm Institute. Between Oct. 2015 - Sept. 2016, he was a postdoctoral researcher in the Data Science and Mining (DaSciM) group of the Computer Science Laboratory (LIX) at École Polytechnique in Paris, France, from where he also received my Ph.D. degree (Sept. 2015), working under the supervision of Prof. Michalis Vazirgiannis. He obtained both his Diploma and his M.Sc. degree from the Computer Engineering and Informatics Department of the University of Patras, Greece in 2009 and 2011 respectively. There, he was fortunate to work with Prof. Vasileios Megalooikonomou.

During the summer of 2014, he was a research intern at the Palo Alto Research Center (PARC) in Palo Alto, CA. He was also the recipient of the 2012 Google Europe Doctoral Fellowship in Graph Mining and the 2015 Thesis Prize by Ecole Polytechnique.

 

Abstract:

Online user: 2 Privacy
Loading...