Zobrazeno 1 - 10
of 20
pro vyhledávání: '"gras, benjamin"'
The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing an enumerat
Externí odkaz:
http://arxiv.org/abs/2205.00086
Publikováno v:
Algorithmica 83(9):2651-2677, 2021
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph $D$ is a function $f:V(D)\to\mathbb{N}$ such that for each vertex $v$ of $D$,
Externí odkaz:
http://arxiv.org/abs/2003.10570
Autor:
Gras, Benjamin
Un système de recommandation a pour objectif de recommander à un utilisateur, appelé utilisateur actif, des ressources pertinentes pour lui. Le filtrage collaboratif (FC) est une approche de recommandation très répandue qui exploite les préfér
Externí odkaz:
http://www.theses.fr/2018LORR0017/document
Autor:
Gras, Benjamin James
Publikováno v:
Gras, B J 2022, ' Side Channel Security Risks In Commodity Microarchitectures ', PhD, Vrije Universiteit Amsterdam, s.l. .
Computing system security is important for everyday functioning of society, among other things. We say that computing systems should preserve Confidentiality (your se- crets stay secret) and Integrity (if you store information, it should remain unch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a3ce329b0caa8ad69c6aa04cd8f2ae2f
https://hdl.handle.net/1871.1/af1080bc-4efa-4fef-a1a3-257fa060cfb5
https://hdl.handle.net/1871.1/af1080bc-4efa-4fef-a1a3-257fa060cfb5
The question to enumerate all (inclusion-wise) minimal connected dominating sets in a graph of order n in time significantly less than 2ⁿ is an open question that was asked in many places. We answer this question affirmatively, by providing an enum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8bacd8f804b9385e5ff1f7806879c93
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.
Publikováno v:
Companion Proceedings 10th International Conference on Learning Analytics & Knowledge (LAK20), Workshop on Addressing Drop-Out Rates in Higher Education (ADORE'20)
Companion Proceedings 10th International Conference on Learning Analytics & Knowledge (LAK20), Workshop on Addressing Drop-Out Rates in Higher Education (ADORE'20), Mar 2020, Frankfurt, Germany
Companion Proceedings 10th International Conference on Learning Analytics & Knowledge (LAK20), Workshop on Addressing Drop-Out Rates in Higher Education (ADORE'20), Mar 2020, Frankfurt, Germany
International audience; This paper focuses on the design process of a student dashboard, in the frame of a Learning Analytics project. The dashboard is intended to reduce dropout of first-year University students. The strong points of this dashboard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bb2d32b423f6f8c5aad32cabdf8c897d
https://hal.inria.fr/hal-02974682
https://hal.inria.fr/hal-02974682
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.
Autor:
Gras, Benjamin
Publikováno v:
Intelligence artificielle [cs.AI]. Université de Lorraine, 2018. Français. ⟨NNT : 2018LORR0017⟩
A recommender system aims at providing relevant resources to a user, named the active user. To allow this recommendation, the system exploits the information it has collected about the active user or about resources. The collaborative filtering (CF)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::98b82f72cf7990977bbc78c8191fa205
https://theses.hal.science/tel-01764021
https://theses.hal.science/tel-01764021
Publikováno v:
Theory of Computing Systems; 2021, Vol. 65 Issue 2, p344-409, 66p
