Related papers: Confluence by Decreasing Diagrams -- Formalized
We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings. Furthermore, it is easier to understand the structures of graphs from the mixed style drawings. The…
Key to successfully deal with complex contemporary datasets is the development of tractable models that account for the irregular structure of the information at hand. This paper provides a comprehensive and unifying view of several…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
McConnell [FOCS 2001] presented a flipping transformation from circular-arc graphs to interval graphs with certain patterns of representations. Beyond its algorithmic implications, this transformation is instrumental in identifying all…
Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…
We establish exponential decay of correlations of all orders for locally $G$-accessible isometric extensions of transitive Anosov flows, under the assumption that the strong stable and strong unstable foliations of the base Anosov flow are…
The mathematics underlying the connection between deconstruction lattices and locality diagrams of conformal models is developed from scratch, with special emphasis on classification issues. In particular, the notions of equilocality…
This article continues the study of diagrams in the bicategory of \'etale groupoid correspondences. We prove that any such diagram has a groupoid model and that the groupoid model is a locally compact \'etale groupoid if the diagram is…
We show that the standard discrete update rule of transformer layers can be naturally interpreted as a forward Euler discretization of a continuous dynamical system. Our Transformer Flow Approximation Theorem demonstrates that, under…
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a semicomplete digraph. In this paper we study various…
We study a blind deconvolution problem on graphs, which arises in the context of localizing a few sources that diffuse over networks. While the observations are bilinear functions of the unknown graph filter coefficients and sparse input…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
Bayesian posterior inference is prevalent in various machine learning problems. Variational inference provides one way to approximate the posterior distribution, however its expressive power is limited and so is the accuracy of resulting…
This is an expository paper on the subject of the title. It assumes basic scheme theory, commutative and homological algebra.
We develop a formalism of cohomological descent encoding adelic points and obstructions to local-global principle on algebraic stacks. As an application, by constructing new obstructions using the formalism, we obtain some comparison…
We prove a relative version of the realization theorem for $h_\infty$-diagrams in case that the underlying diagram subcategory is factorization-closed.
Image deblurring is relevant in many fields of science and engineering. To solve this problem, many different approaches have been proposed and among the various methods, variational ones are extremely popular. These approaches are…
We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…
The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…