相关论文: Let's reinvent subtraction
We present an efficient and robust reference resolution algorithm in an end-to-end state-of-the-art information extraction system, which must work with a considerably impoverished syntactic analysis of the input sentences. Considering this…
We introduce a new system of split variational inequality problems which is a natural extension of split variational inequality problem in semi-inner product spaces. We use the retraction technique to propose an iterative algorithm for…
First we define a new kind of function over $\mathbb{N}$. For each $i\in\mathbb{N}$ we have an associated function, which will be called $S_i$ . Then we define a new kind of sequence, to be made from the functions $S_i$ . Finally, we will…
Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.
We consider possible reconstructions of a binary image of which the row and column sums are given. For any reconstruction we can define the length of the boundary of the image. In this paper we prove a new lower bound on the length of this…
Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained…
In synchronous rewriting, the productions of two rewriting systems are paired and applied synchronously in the derivation of a pair of strings. We present a new synchronous rewriting system and argue that it can handle certain phenomena…
We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving…
This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…
We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
Relation Extraction is an important sub-task of Information Extraction which has the potential of employing deep learning (DL) models with the creation of large datasets using distant supervision. In this review, we compare the…
Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation…
The act of telling stories is a fundamental part of what it means to be human. This work introduces the concept of narrative information, which we define to be the overlap in information space between a story and the items that compose the…
We give development of a new theory of the Pitchfork bifurcation, which removes the perspective of the third derivative and a requirement of symmetry.
A newly-generalized problem from a problem initially thought for the Mathematical Olympiad and the methods to solve it.
In an earlier paper we introduced the notion of 'bifurcating continued fractions' in a heuristic manner. In this paper a formal theory is developed for the 'bifurcating continued fractions'.
We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…
Skip-gram (word2vec) is a recent method for creating vector representations of words ("distributed word representations") using a neural network. The representation gained popularity in various areas of natural language processing, because…