Given the widespread availability of point cloud data from consumer depth sensors, 3D point cloud segmentation becomes a promising building block for high level applications such as scene understanding and interaction ...

Today, network operators still lack functional network models able to make accurate predictions of end-to-end Key Performance Indicators (e.g., delay).This thesis introduces the benchmark for computer network modeling using ...

This work deals with the construction of snarks, that is, cubic graphs that cannot be 3-edge-colored. A natural generalization of the concept of "color", that describes in a simple way the coloring ("0" or "1") of any set ...

In this note we construct a new infinite family of (q - 1)-regular graphs of girth 8 and order 2q(q - 1)(2) for all prime powers q >= 16, which are the smallest known so far whenever q - 1 is not a prime power or a prime ...

A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree. A mixed regular graphs is said to be optimal if there is not a mixed ...

This paper presents a data-driven technique for the localization of leaks in water distribution networks (WDN). The methodology requires hydraulic data, i.e., pressure measurements from a set of sensors installed throughout ...

Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, different models that provide exact solutions have already ...

The main purpose of this thesis is to nd a method that allows to systematically adapt GSP techniques so they can be used on most non-diagonalizable graph operators. In Chapter 1 we begin by presenting the framework in ...

In this paper we tackle the problem of extending the logic of nested graph conditions with paths. This means, for instance, that we may state properties about the existence of paths between some given nodes. As a main ...