Trees in the Real Field

07/11/2018
by   Alessandro Betti, et al.
0

This paper proposes an algebraic view of trees which opens the doors to an alternative computational scheme with respect to classic algorithms. In particular, it is shown that this view is very well-suited for machine learning and computational linguistics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2022

Linear random generation of Motzkin trees

Motzkin trees are also called unary-binary trees. This paper proposes a ...
research
10/13/2009

State of the Art Review for Applying Computational Intelligence and Machine Learning Techniques to Portfolio Optimisation

Computational techniques have shown much promise in the field of Finance...
research
12/13/2017

B-slack trees: Highly Space Efficient B-trees

B-slack trees, a subclass of B-trees that have substantially better wors...
research
07/28/2019

Structure of Trees with Respect to Nodal Vertex Sets

Let T be a tree with a given adjacency eigenvalue λ. In this paper, by u...
research
04/08/2020

On recursively defined combinatorial classes and labelled trees

We define and prove isomorphisms between three combinatorial classes inv...
research
12/11/2020

The Complexity of Comparative Text Analysis – "The Gardener is always the Murderer" says the Fourth Machine

There is a heated debate about how far computers can map the complexity ...

Please sign up or login with your details

Forgot password? Click here to reset