Related papers: The Harmonic GBC Function Map is a Bijection if th…
The intention of this survey to collect in one paper many recent results and advances related with Bergman type projection acting in various spaces of analytic functions in several complex variables in the unit ball, tubular domains over…
We extended the study of the linear fractional self maps (e.g. by Cowen-MacCluer and Bisi-Bracci on the unit balls) to a much more general class of domains, called generalized type-I domains, which includes in particular the classical…
Graph signal processing extends spectral analysis to data supported on irregular domains. Existing fractional transforms for two-dimensional graph signals, including the two-dimensional graph fractional Fourier transform (GFRFT), typically…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
This paper gives a geometric description of functional spaces related to Domain Decomposition techniques for computing solutions of Laplace and Helmholtz equations. Understanding the geometric structure of these spaces leads to algorithms…
Self-concordance is the most important property required for barriers in convex programming. It is intrinsically linked to the affine structure of the underlying space. Here we introduce an alternative notion of self-concordance which is…
The purpose of this study is to develop a deep learning based method that can automatically generate segmentations on cone-beam CT (CBCT) for head and neck online adaptive radiation therapy (ART), where expert-drawn contours in planning CT…
We study Bayesian model selection in colored Gaussian graphical models (CGGMs), which combine sparsity of conditional independencies with symmetry constraints encoded by vertex- and edge-colored graphs. A computational bottleneck in…
Harmonic surface deformation is a well-known geometric modeling method that creates plausible deformations in an interactive manner. However, this method is susceptible to artifacts, in particular close to the deformation handles. These…
A bipartite graph $G=(A,B,E)$ is ${\cal H}$-convex, for some family of graphs ${\cal H}$, if there exists a graph $H\in {\cal H}$ with $V(H)=A$ such that the set of neighbours in $A$ of each $b\in B$ induces a connected subgraph of $H$.…
Information transfer between triangle meshes is of great importance in computer graphics and geometry processing. To facilitate this process, a smooth and accurate map is typically required between the two meshes. While such maps can…
Image reconstruction in X ray tomography consists in determining an object from its projections. In many applications such as non destructive testing, we look for an image who has a constant value inside a region (default) and another…
This paper concerns with the graphical derivative of the normals to the conic constraint $g(x)\in\!K$, where $g\!:\mathbb{X}\to\mathbb{Y}$ is a twice continuously differentiable mapping and $K\subseteq\mathbb{Y}$ is a nonempty closed convex…
It is proved that a bijection between two compact hyperbolic surfaces with boundary is an isometry if it and its inverse map each geodesic onto some geodesic.
For graphs $G$ and $H$, a homomorphism from $G$ to $H$ is a function $\varphi \colon V(G) \to V(H)$, which maps vertices adjacent in $G$ to adjacent vertices of $H$. A homomorphism is locally injective if no two vertices with a common…
The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does…
Recently, harmonic functions and frequently universal harmonic functions on a tree $T$ have been studied, taking values on a separable Fr\'{e}chet space $E$ over the field $\mathbb{C}$ or $\mathbb{R}$. In the present paper, we allow the…
Width-based planning methods deal with conjunctive goals by decomposing problems into subproblems of low width. Algorithms like SIW thus fail when the goal is not easily serializable in this way or when some of the subproblems have a high…
Our purpose is to use a Darboux homogenous derivative to understand the harmonic maps with values in homogeneous space. We present a characterization of these harmonic maps from the geometry of homogeneous space. Furthermore, our work…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…