Ergebnisse einschränken

Sprache

Università della Svizzera italiana

A privacy-aware and secure system for human memory augmentation

Bexheti, Agon ; Langheinrich, Marc (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2019 ; 2019INFO011.

The ubiquity of digital sensors embedded in today's mobile and wearable devices (e.g., smartphones, wearable cameras, wristbands) has made technology more intertwined with our life. Among many other things, this allows us to seamlessly log our daily experiences in increasing numbers and quality, a process known as ``lifelogging''. This practice produces a great amount of pictures and videos...

Università della Svizzera italiana

Modeling user information needs on mobile devices : from recommendation to conversation

Aliannejadi, Mohammad ; Crestani, Fabio (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2019 ; 2019INFO010.

Recent advances in the development of mobile devices, equipped with multiple sensors, together with the availability of millions of applications have made these devices more pervasive in our lives than ever. The availability of the diverse set of sensors, as well as high computational power, enable information retrieval (IR) systems to sense a user’s context and personalize their results ...

Université de Fribourg

Reducing the Domination Number of Graphs via Edge Contractions

Galby, Esther ; Lima, Paloma T. ; Ries, Bernard

In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) - LIPICS Vol. 138, 2019, p. 41:1-41:13

In this paper, we study the following problem: given a connected graph G, can we reduce the domination number of G by at least one using k edge contractions, for some fixed integer k >= 0? We show that for k <= 2, the problem is coNP-hard. We further prove that for k=1, the problem is W[1]-hard parameterized by the size of a minimum dominating set plus the mim-width of the input graph, and that...

Università della Svizzera italiana

When and how java developers give up static type safety

Mastrangelo, Luis ; Hauswirth, Matthias (Dir.) ; Nystrom, Nathaniel (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2019 ; 2019INFO008.

The main goal of a static type system is to prevent certain kinds of errors from happening at run time. A type system is formulated as a set of constraints that gives any expression or term in a program a well-defined type. Besides detecting these kinds of errors, a static type system can be an invaluable maintenance tool, can be useful for documentation purposes, and can aid in generating ...

Public access from 15.09.2021
Université de Fribourg

Maximum eccentric connectivity index for graphs with given diameter

Hauweele, Pierre ; Hertz, Alain ; Mélot, Hadrien ; Ries, Bernard ; Devillez, Gauvain

In: Discrete Applied Mathematics, 2019, vol. 268, p. 102-111

The eccentricity of a vertex v in a graph G is the maximum distance between v and any other vertex of G. The diameter of a graph G is the maximum eccentricity of a vertex in G. The eccentric connectivity index of a connected graph is the sum over all vertices of the product between eccentricity and degree. Given two integers n and D with D ≤ n−1, we characterize those graphs which have...

Université de Fribourg

Reducing the Domination Number of Graphs via Edge Contractions

Galby, Esther ; Lima, Paloma T. ; Ries, Bernard

In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2014, no. 41, p. 1-13

In this paper, we study the following problem: given a connected graph G, can we reduce the domination number of G by at least one using k edge contractions, for some fixed integer k >=0? We show that for k <=2, the problem is coNP-hard. We further prove that for k = 1, the problem is W[1]-hard parameterized by the size of a minimum dominating set plus the mim-width of the input graph, and...

Università della Svizzera italiana

Behaviour of exponential three-point coordinates at the vertices of convex polygons

Anisimov, Dmitry ; Hormann , Kai ; Schneider

In: Journal of computational and applied mathematics, 2019, vol. 350, p. 114-129

Barycentric coordinates provide a convenient way to represent a point inside a triangle as a convex combination of the triangle’s vertices and to linearly interpolate data given at these vertices. Due to their favourable properties, they are commonly applied in geometric modelling, finite element methods, computer graphics, and many other fields. In some of these applications, it is desirable...

Université de Fribourg

Visualizing semantic data

Luggen, Michael

In: Visualizing Semantic Data, 2018, p. 1-6

Visualizing semantic data describes the task of using the additional self describing features of semantic data (Linked Data/RDF) to inform the process of creating vector or bitmap drawings.

Public access from 09.07.2021
Université de Fribourg

Detecting strong cliques

Hujdurovic, Ademir ; Milanic, Martin ; Ries, Bernard

In: Discrete Mathematics, 2019, vol. 342, no. 9, p. 2738-2750

A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their complexity in the classes of chordal graphs, weakly chordal graphs, line graphs and their complements, and graphs of maximum degree at most three. Our results rely...

Université de Fribourg

Bicolored Matchings in Some Classes of Graphs

Costa, Marie-Christine ; de Werra, Dominique ; Picouleau, Christophe ; Ries, Bernard

In: Graphs and Combinatorics, 2007, vol. 23, no. 1, p. 47-60

We consider the problem of finding in a graph a set R of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with n nodes on each side, we give sufficient conditions for the existence of a set R with |R| = n + 1 such that perfect matchings with k red edges exist for all k, 0 ≤ k ≤ n. Given two integers p...