Affiner les résultats

Collection spécifique

Langue

Consortium of Swiss Academic Libraries

SEEDS: Superpixels Extracted Via Energy-Driven Sampling

Van den Bergh, Michael ; Boix, Xavier ; Roig, Gemma ; Van Gool, Luc

In: International Journal of Computer Vision, 2015, vol. 111, no. 3, p. 298-314

Università della Svizzera italiana

RESTalk : a visual and textual DSL for modelling RESTful conversations

Ivanchikj, Ana ; Pautasso, Cesare (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2021 ; 2021INFO001.

Digitalization is all around us, even more so in pandemic times where substantial part of our lives has been moved online. One of the key enablers of digitalization are the Application Programming Interfaces (APIs) which enable the communication and exchange of data between different systems. They abstract from the implementation details of the underlying systems and allow for the monetization...

Università della Svizzera italiana

Voronoi-like diagrams : towards linear-time algorithms for tree-like abstract Voronoi diagrams

Junginger, Kolja ; Papadopoulou, Evanthia (Dir.)

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

Computational Geometry is a subfield of Algorithm Design and Analysis with a focus on the design and analysis of algorithms related to discrete geometric objects. The Voronoi diagram is one of the most important structures in Computational Geometry providing proximity information, which is applicable to many different fields of science. For a given set of points in the plane – called sites...

Université de Fribourg

On some applications of the selective graph coloring problem

Demange, Marc ; Ekim, Tinaz ; Ries, Bernard ; Tanasescu, Cerasela

In: European Journal of Operational Research, 2015, vol. 240, no. 2, p. 307-314

In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph col-oring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the chromatic number of the subgraph induced by the selected vertices is minimum. This problem appeared...

Consortium of Swiss Academic Libraries

A Geometric Proof of the Colored Tverberg Theorem

Matoušek, Jiří ; Tancer, Martin ; Wagner, Uli

In: Discrete & Computational Geometry, 2012, vol. 47, no. 2, p. 245-265

Consortium of Swiss Academic Libraries

The Exact Hausdorff Measure of the Zero Set ofFractional Brownian Motion

Baraka, D. ; Mountford, T.

In: Journal of Theoretical Probability, 2011, vol. 24, no. 1, p. 271-293

Consortium of Swiss Academic Libraries

Ptolemy circles and Ptolemy segments

Foertsch, Thomas ; Schroeder, Viktor

In: Archiv der Mathematik, 2012, vol. 98, no. 6, p. 571-581