Zobrazeno 1 - 10
of 255
pro vyhledávání: '"Lafourcade, Pascal"'
In 2022, Olivier Longuet, a French mathematics teacher, created a game called the \textit{calissons puzzle}. Given a triangular grid in a hexagon and some given edges of the grid, the problem is to find a calisson tiling such that no input edge is ov
Externí odkaz:
http://arxiv.org/abs/2307.02475
Autor:
Crombez, Loïc, da Fonseca, Guilherme D., Fontan, Florian, Gerard, Yan, Gonzalez-Lorenzo, Aldo, Lafourcade, Pascal, Libralesso, Luc, Momège, Benjamin, Spalding-Jamieson, Jack, Zhang, Brandon, Zheng, Da Wei
CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments. Surprisingly, the top three teams used the same technique, called conflict optimization. T
Externí odkaz:
http://arxiv.org/abs/2303.09632
Biometric recognition encompasses two operating modes. The first one is biometric identification which consists in determining the identity of an individual based on her biometrics and requires browsing the entire database (i.e., a 1:N search). The o
Externí odkaz:
http://arxiv.org/abs/2205.04229
Autor:
Durbet, Axel, Lafourcade, Pascal, Migdal, Denis, Thiry-Atighehchi, Kevin, Grollemund, Paul-Marie
Cancelable biometric schemes aim at generating secure biometric templates by combining user specific tokens, such as password, stored secret or salt, along with biometric data. This type of transformation is constructed as a composition of a biometri
Externí odkaz:
http://arxiv.org/abs/2110.15163
Autor:
Crombez, Loïc, da Fonseca, Guilherme D., Gerard, Yan, Gonzalez-Lorenzo, Aldo, Lafourcade, Pascal, Libralesso, Luc
Publikováno v:
ACM Journal of Experimental Algorithmics, 27, 3.2, 1-17, 2022
This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge. This year's problem is to coordinate the motion of multiple robots in order to reach their targets without collisions and minimizing the makespan. It is a cl
Externí odkaz:
http://arxiv.org/abs/2103.13956
Publikováno v:
Theoretical Computer Science, Elsevier, In press
In Conspiracy Santa, a variant of Secret Santa, a group of people offer each other Christmas gifts, where each member of the group receives a gift from the other members of the group. To that end, the members of the group form conspiracies, to decide
Externí odkaz:
http://arxiv.org/abs/2005.09244
In 1968, Liu described the problem of securing documents in a shared secret project. In an example, at least six out of eleven participating scientists need to be present to open the lock securing the secret documents. Shamir proposed a mathematical
Externí odkaz:
http://arxiv.org/abs/2004.11552
Publikováno v:
In Theoretical Computer Science 25 October 2023 977
Autor:
Darwich, Omar, Ulucan, Ahmet-Sefa, Bramas, Quentin, Lamani, Anissa, Durand, Anaïs, Lafourcade, Pascal
Publikováno v:
In Theoretical Computer Science 17 October 2023 976
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.