Related papers: An example of goal-directed, calculational proof
Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent…
Object ranking or "learning to rank" is an important problem in the realm of preference learning. On the basis of training data in the form of a set of rankings of objects represented as feature vectors, the goal is to learn a ranking…
We prove a result about extension of a minimal AF-equivalence relation R on the Cantor set X, the extension being `small' in the sense that we modify R on a thin closed subset Y of X. We show that the resulting extended equivalence relation…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
We introduce a direct image formalism for constructible motivic functions. One deduces a very general version of motivic integration for which a change of variables theorem is proved. These constructions are generalized to the relative…
The aim of this article is to develop an explicit procedure that enables one to reconstruct any $C^1$ path (at natural parametrization) from its signature. We also explicitly quantify the distance between the reconstructed path and the…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…
In this paper we describe a novel method for evidential reasoning [1]. It involves modelling the process of evidential reasoning in three steps, namely, evidence structure construction, evidence accumulation, and decision making. The…
Given comparative text, comparative relation extraction aims to extract two targets (\eg two cameras) in comparison and the aspect they are compared for (\eg image quality). The extracted comparative relations form the basis of further…
The quest for efficient sorting is ongoing, and we will explore a graph-based stable sorting strategy, in particular employing comparison graphs. We use the topological sort to map the comparison graph to a linear domain, and we can…
Rank-based linkage is a new tool for summarizing a collection $S$ of objects according to their relationships. These objects are not mapped to vectors, and ``similarity'' between objects need be neither numerical nor symmetrical. All an…
Under a slightly stronger hypothesis, one improves a connectedness result of Debarre [D] for a product of two projective spaces in terms of the extension problem of formal-rational functions (see Theorems 1.3 and 1.4 of the introduction)
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
Two semisimple algebraic groups of the same type are said to be motivic equivalent if the motives of the associated projective homogeneous varieties of the same type are isomorphic. We give general criteria of motivic equivalence in terms…
We introduce a concept of similarity between vertices of directed graphs. Let G_A and G_B be two directed graphs. We define a similarity matrix whose (i, j)-th real entry expresses how similar vertex j (in G_A) is to vertex i (in G_B. The…