In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
A common approach to split selection in classification trees is to search through all possible splits generated by predictor variables. A splitting criterion is then used to evalu...
Abstract— In this paper we present a topological map building algorithm based on a Vocabulary Tree that is robust to features present in dynamic or similar environments. The algo...
Deon George Sabatta, Davide Scaramuzza, Roland Sie...