Links' Seminars and Public Events Add to google calendar
Thu 30th May
to Fri 31st May
 all day
Add event to google
Pysemigroup Hackaton

Fri 24th May
11:00 am
11:30 am
Add event to google
Séminaire Sophie Tison
Speaker: Sophie Tison

Title: Containment of Regular Path Queries Under Constraints
Thu 16th May
2:00 pm
4:00 pm
Add event to google
Seminar Arkaprava
Title: Efficient Optimization of Network Metrics in Large Uncertain

Abstract: Graphs constitute an omnipresent data structure that can
model objects and their relationships in a wide variety of real-world
scenarios. The optimization of network metrics finds use in a plethora
of real-world applications. Most of the exact techniques for such tasks
turn out to be prohibitively time-consuming and memory-intensive for
the huge graphs that are usually encountered. Thus, there is a need for
efficient approximation algorithms. This talk focuses on the efficient
optimization of network metrics in large uncertain graphs, and
specifically the following three research problems. The first problem
aims to find, between a given pair of nodes in an uncertain graph, the
path having the highest probability of being a shortest path. The
second problem aims to find, in an uncertain graph, the subgraph having
the highest probability of being densest. The third problem is a novel
variant of the well-known opinion maximization problem where, given a
social network of users with real-valued opinions (about different
candidates), the goal is to choose the top-k seed users maximizing a
specific voting-based score at a given finite time horizon.
Best Regards,
"Lieu : Lille, Salle : B11"

Permanent link to this article: