Calendrier de Évènements
L lun
M mar
M mer
J jeu
V ven
S sam
D dim
0 évènement,
0 évènement,
0 évènement,
1 évènement,
Séminaire Image : « Decomposable Symbolic Regression Using Transformers and Neural Network-Assisted Genetic Algorithms », Giorgio Morales
Séminaire Image : « Decomposable Symbolic Regression Using Transformers and Neural Network-Assisted Genetic Algorithms », Giorgio Morales
Nous aurons le plaisir d'écouter Giorgio Morales, post-doc de l'équipe Image. Il donnera un séminaire IMAGE le jeudi 3 avril 2025 à 14h en salle de séminaire F-200. Titre : "Decomposable Symbolic Regression Using Transformers and Neural Network-Assisted Genetic Algorithms" Résumé : One of the goals of science is to discover laws that serve as … Continue reading Séminaire Image : « Decomposable Symbolic Regression Using Transformers and Neural Network-Assisted Genetic Algorithms », Giorgio Morales
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
1 évènement,
Kévin Carrier – Combinatorial Attacks On The Decoding Problem
Kévin Carrier – Combinatorial Attacks On The Decoding Problem
The decoding problem is fundamental in post-quantum cryptography. It can be broadly described as essentially solving a linear system with a non-linear constraint on the solution. Phrased this way, the problem applies to both code-based and lattice-based cryptography. For example, the linear system may be defined over FF_q, with the non-linear constraint being a condition … Continue reading Kévin Carrier – Combinatorial Attacks On The Decoding Problem
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
1 évènement,
Séminaire Algorithmique : Josselin Guéneron (GREYC) « Repeated Stochastic Coalition Formation: representations and algorithmic approaches »
Séminaire Algorithmique : Josselin Guéneron (GREYC) « Repeated Stochastic Coalition Formation: representations and algorithmic approaches »
Coalition formation is a cooperative game theory framework in which a set of agents, required to perform implicit or explicit tasks, must be divided into subgroups (called coalitions), according to collective criteria and a utility function describing the utility of each coalition. This is equivalent to a problem of partitioning the set of agents. The … Continue reading Séminaire Algorithmique : Josselin Guéneron (GREYC) « Repeated Stochastic Coalition Formation: representations and algorithmic approaches »
0 évènement,
1 évènement,
Séminaire Image : « Multi-modal Identity Extraction », Ryan Webster
Séminaire Image : « Multi-modal Identity Extraction », Ryan Webster
Nous aurons le plaisir d'écouter Ryan Webster, post-doctorant à l'INRIA Rennes. Il donnera un séminaire IMAGE le jeudi 24 avril 2025 à 14h en salle de séminaire F-200. Titre : "Multi-modal Identity Extraction" Résumé : Foundational Vision Language Models (VLMs) exhibit extremely general capabilities derived from their web-scale training data. Because web data inherently contains … Continue reading Séminaire Image : « Multi-modal Identity Extraction », Ryan Webster
0 évènement,
0 évènement,
0 évènement,
0 évènement,
2 évènements,
Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »
Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »
In 1964, R. Berger proved the existence of strongly aperiodic subshifts of finite type (SFT) on $\mathbb{Z}^2$, and used them to prove the undecidability of the Domino Problem. With the goal of understanding what aspects of $\mathbb{Z}^2$ account for this result, there has been an effort in recent years to characterize the groups with undecidable … Continue reading Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »
Tristan Benoît – Approche multimodale pour la génération de noms de fonctions à partir du code binaire
Tristan Benoît – Approche multimodale pour la génération de noms de fonctions à partir du code binaire
La compréhension du code binaire est cruciale en rétro-ingénierie. Usuellement, des bases de fonctions servent à identifier dans un binaire les fonctions proches de références connues. Cependant, souvent les projections sous-jacentes traitent chaque code source séparément. En revanche, les modèles de langage récents permettent de projeter le code binaire et sa description textuelle dans un … Continue reading Tristan Benoît – Approche multimodale pour la génération de noms de fonctions à partir du code binaire
1 évènement,
Mengce Zheng – Lattice-based solving strategy using Coppersmith’s techniques and its applications
Mengce Zheng – Lattice-based solving strategy using Coppersmith’s techniques and its applications
Lattice-based cryptanalysis using Coppersmith's techniques has emerged as a powerful approach to compromising the security of several cryptographic algorithms under specific conditions. This talk will provide an exploration of the lattice-based solving strategy, which leverages lattice basis reduction to find small roots of polynomial equations modulo an integer. This method is then used for examining … Continue reading Mengce Zheng – Lattice-based solving strategy using Coppersmith’s techniques and its applications
0 évènement,
0 évènement,
0 évènement,
0 évènement,
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.
- There are no events on this day.