Refine my results



Université de Fribourg

Intelligence Artificielle : Un aperçu

Mondal, Manuel ; Lalanne, Denis

(Internal working papers DIUF ; 21-03)

L’objectif de ce document est de présenter une introduction concise aux concepts fonda-mentaux de l’Intelligence Artificielle. Il s’adresse à toutes les personnes extérieures au domaine, curieuses à le découvrir ou à en approfondir leurs connaissances, tel que des chercheurs d’autres disciplines à la recherche de nouveaux outils, des juristes confrontés à des algorithmes de...

Université de Fribourg

Demystifying Artificial Intelligence

Mondal, Manuel ; Lalanne, Denis

(Internal working papers DIUF ; 21-02)

The objective of this document is to provide a non-technical introduction to the field of Artificial Intelligence. It is intended for anyone outside of the data science community curi-ous about the subject, such as researchers from other areas looking for new instruments, legal professionals confronted with automated decision making algorithms or legal tech tools, en-trepreneurs interested in...

Université de Fribourg

CPG graphs : Some Structural and Hardness Results

Champseix, Nicolas ; Galby, Esther ; Munaro, Andrea ; Ries, Bernard

In: Discrete Applied Mathematics, 2021, vol. 290, p. 17-35

In this paper we continue the systematic study of Contact graphs of Paths on a Grid (CPG graphs) initiated in Deniz et al. (2018). A CPG graph is a graph for which there exists a collection of pairwise interiorly disjoint paths on a grid in one-to-one correspondence with its vertex set such that two vertices are adjacent if and only if the corresponding paths touch at a grid-point. If every...

Université de Fribourg

Blocking Total Dominating Sets Via Edge Contractions

Galby, Esther ; Mann, Felix ; Ries, Bernard

In: Theoretical Computer Science, 2021, vol. 877, p. 18-35

In this paper, we study the problem of deciding whether the total domination number of a given graph Gcan be reduced using exactly one edge contraction (called1-Edge Contraction(γt)). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete complexity dichotomy for H-free graphs.

Université de Fribourg

VADETIS : an Explainable Evaluator for Anomaly Detection Techniques

Khelifati, Abdelouahab ; Khayati, Mourad ; Cudré-Mauroux, Philippe ; Hänni, Adrian ; Liu, Qian ; Hauswirth, Manfred

In: IEEE 37th International Conference on Data Engineering (ICDE), 2021, p. 2661--2664

Anomaly detection is a fundamental problem that consists of identifying irregular patterns that do not conform to the expected behavior of a system or the generated data. Many anomaly detection techniques have been proposed for time series data. However, selecting the most suitable detection method remains challenging as the proposed techniques widely vary in performance. The appropriate...

Consortium of Swiss Academic Libraries

The impact of cognitive load on delayed recall

Camos, Valérie ; Portrat, Sophie

In: Psychonomic Bulletin & Review, 2015, vol. 22, no. 4, p. 1029-1034