Refine my results

Language

Università della Svizzera italiana

Less is more : efficient hardware design through Approximate Logic Synthesis

Scarabottolo, Ilaria ; Pozzi, Laura (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2020 ; 2020INFO023.

As energy efficiency becomes a crucial concern in almost every kind of digital application, Approximate Computing gains popularity as a potential answer to this ever-growing energy quest. Approximate Computing is a design paradigm particularly suited for error- resilient applications, where small losses in accuracy do not represent a significant reduction in the quality of the result. In these...

Université de Fribourg

Degree-constrained edge partitioning in graphs arising from discrete tomography

Bentz, Cédric ; Costa, Marie-Christine ; Picouleau, Christophe ; Ries, Bernard ; de Werra, Dominique

In: Journal of Graph Algorithms and Applications, 2009, vol. 13, no. 2, p. 99-118

Starting from the basic problem of reconstructing a 2-dimensional im- age given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k = 3 colors is open. Variations and special cases are considered for the case k = 3 colors where the graph corresponding to the union of some color classes (for instance colors 1...

Consortium of Swiss Academic Libraries

A Gaussian Distribution for Refined DT Invariants and 3D Partitions

Morrison, Andrew

In: Communications in Mathematical Physics, 2014, vol. 331, no. 3, p. 1029-1039

Université de Fribourg

On the minimum and maximum selective graph coloring problems in some graph classes

Ries, Bernard

In: Discrete Applied Mathematics, 2016, vol. 204, p. 77-89

Given a graph together with a partition of its vertex set, the minimum selective coloring problem consists of selecting one vertex per partition set such that the chromatic number of the subgraph induced by the selected vertices is minimum. The contribution of this paper is twofold. First, we investigate the complexity status of the minimum selective coloring problem in some specific graph...

Consortium of Swiss Academic Libraries

The Critical Ising Model via Kac-Ward Matrices

Cimasoni, David

In: Communications in Mathematical Physics, 2012, vol. 316, no. 1, p. 99-126