Related papers: Consistent digital line segments
A new framework to perform routing at the Autonomous System level is proposed in this paper. This mechanism, called Chain Routing, uses complete orders as its main topological unit. Since complete orders are acyclic digraphs that possess a…
Optimal quasiconformal dimension distortions bounds for subsets of the complex plane have been established by Astala. We show that these estimates can be improved when one considers subsets of the real line of arbitrary Hausdorff dimension.…
Unsupervised clustering of temporal data is both challenging and crucial in machine learning. In this paper, we show that neither traditional clustering methods, time series specific or even deep learning-based alternatives generalise well…
Quasi-Monte Carlo methods are a way of improving the efficiency of Monte Carlo methods. Digital nets and sequences are one of the low discrepancy point sets used in quasi-Monte Carlo methods. This thesis presents the three new results…
This study provides new results about the probabilistic behaviour of a class of Euclidean algorithms: the asymptotic distribution of a whole class of cost-parameters associated to these algorithms is normal. For the cost corresponding to…
In this paper we provide a complete approach to the real numbers via decimal representations. Construction of the real numbers by Dedekind cuts, Cauchy sequences of rational numbers, and the algebraic characterization of the real number…
We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This…
This paper concerns the \textbf{abstract geometry of numbers}: namely the pursuit of certain aspects of geometry of numbers over a suitable class of normed domains. (The standard geometry of numbers is then viewed as geometry of numbers…
We introduce a general diagrammatic theory of digital circuits, based on connections between monoidal categories and graph rewriting. The main achievement of the paper is conceptual, filling a foundational gap in reasoning syntactically and…
Following in the footsteps of P. Erd\H{o}s and A. R\'enyi we compute the Hausdorff dimension of sets of numbers whose digits with respect to their $Q$-Cantor series expansions satisfy various statistical properties. In particular, we…
This article is devoted to the construction of numerical methods which remain insensitive to the smallness of the semiclassical parameter for the linear Schr{\"o}dinger equation in the semiclassical limit. We specifically analyse the…
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…
Partial orders and directed acyclic graphs are commonly recurring data structures that arise naturally in numerous domains and applications and are used to represent ordered relations between entities in the domains. Examples are task…
In this paper, we present a novel way to summarize the structure of large graphs, based on non-parametric estimation of edge density in directed multigraphs. Following coclustering approach, we use a clustering of the vertices, with a…
The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…
We compute the Hausdorff dimension of sets of very well approximable vectors on rational quadrics. We use ubiquitous systems and the geometry of locally symmetric spaces. As a byproduct we obtain the Hausdorff dimension of the set of rays…
In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a sampling approach for such metric graphs that, using a…
In this paper, we propose and analyze a linear second-order numerical method for solving the Allen-Cahn equation with a general mobility. The proposed fully-discrete scheme is carefully constructed based on the combination of first and…
We analyse a new notion of total anisotropic higher-order variation which, differently from the Total Generalized Variation by Bredies et al., quantifies for possibly non-symmetric tensor fields their variations at arbitrary order weighted…
Reliable quality assessment of decoded point cloud geometry is essential to evaluate the compression performance of emerging point cloud coding solutions and guarantee some target quality of experience. This paper proposes a novel point…