Mathematical Formula Representation via Tree Embeddings

Key words: Skorokhod embeddings, Hardy-Littlewood functions, convex order, Schauder fixed point theorem, self-similar martingales, Karamata’s representation theorem.. 2000 MSC:

We assume that dictionary entries (a definition of a word) contain latent word similarity and relatedness information that can improve language representations.. Such entries

The tree leaves correspond the regions of the initial partition and the remaining tree nodes represent regions formed by the merging of two children regions.The root node represents

Olivier Bernardi. Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.. We define a bijection Φ between spanning subgraphs and orien-

From our study of some systems presented in the literature, we notice that there are mainly two approaches to identify the script: global and local approaches. The global approach

For this legal document retrieval task, we present our approach that finds the similarity between a given query and prior cases/statutes documents by applying three variations of

In this work we propose an approach for rule learning guided by external sources that allows to learn high-quality rules from incomplete KGs.. Our proposal is to learn rules that

In this demonstration paper we present and evaluate the improved query func- tionalities of Ontodia, which apply vector similarity with word embeddings be- tween query terms and