• FindSteinerTree

  • Referenced in 12 articles [sw08245]
  • program for computing Steiner Trees in multiple dimensions, written by Christian Peter Klingenberg ... find Steiner minimal trees in Euclidean d-space. Algorithmica 7:137–177). This algorithm uses...
  • SMAC

  • Referenced in 71 articles [sw27215]
  • speed up both local search and tree search algorithms by orders of magnitude on certain ... machine learning algorithms, scaling better to high dimensions and discrete input dimensions than other algorithms...
  • ANN

  • Referenced in 46 articles [sw09854]
  • applications in significantly higher dimensions, the results are rather spotty, but you might ... different data structures, based on kd-trees and box-decomposition trees, and employs a couple...
  • Garamon

  • Referenced in 6 articles [sw30354]
  • tree, and Garamon, a C++ library generator implementing these recursive operations. While for low dimension ... efficient strategy, it fails for higher dimensions where the operation should be computed ... time. This paper describes how a prefix tree can be a support for a recursive ... prefix tree formulation to implement Geometric Algebra operations on high dimensions hardly accessible with state...
  • Cosmos++

  • Referenced in 4 articles [sw16653]
  • using a fully threaded oct-tree (in three dimensions) network to traverse the grid hierarchy...
  • FMM-Yukawa

  • Referenced in 9 articles [sw10444]
  • particles in three dimensions. The method utilizes an adaptive oct-tree structure, and is based...
  • AFOPT

  • Referenced in 4 articles [sw18901]
  • Existing pattern growth algorithms differ in several dimensions: (1) item search order; (2) conditional database ... tree traversal strategy. They adopted different strategies on these dimensions. Several adaptive algorithms were proposed...
  • Arbor3D

  • Referenced in 1 article [sw37014]
  • examining phylogenetic and taxonomic trees in multiple dimensions. This paper examines a new technique ... visualization of and the interaction with trees, objects frequently used to convey hierarchical relationships...
  • CoDEx

  • Referenced in 8 articles [sw28085]
  • Wilson Coefficients of SMEFT operators (up to dimension - 6) to connect some Beyond Standard Model ... multiple degenerate heavy field propagators, at tree and one-loop level...
  • REBOUND

  • Referenced in 3 articles [sw27308]
  • superior to a tree code for simulations in which one dimension is much longer than...
  • Gudhi

  • Referenced in 32 articles [sw08777]
  • Gudhi library (Geometric Understanding in Higher Dimensions) is a generic C++ library for computational topology ... simplicial complexes are implemented with a simplex tree data structure. The simplex tree...
  • cort

  • Referenced in 1 article [sw36262]
  • dimension. The last model consist of the implementation of the Copula Recursive Tree algorithm proposed...
  • libkdtree++

  • Referenced in 1 article [sw05587]
  • using a kd-tree. It sports a theoretically unlimited number of dimensions, and can store ... means to rebalance and thus optimise the tree...
  • Algorithm 991

  • Referenced in 1 article [sw36047]
  • overlapping windows by storing them in a tree data-structure based on the ideas ... algorithm easily extends to higher dimensions...
  • TreeSOM

  • Referenced in 5 articles [sw01963]
  • dimensional space onto a small number of dimensions by placing similar elements close together, forming ... confidence and visualize the result as a tree facilitating comparison with existing hierarchical classifiers...
  • flavio

  • Referenced in 7 articles [sw23848]
  • effects are parameterised as Wilson coefficients of dimension-six operators in the weak effective theory ... systems, tree-level semi-leptonic B, K, and D decays (including possible lepton universality violation...
  • libmpdata++

  • Referenced in 5 articles [sw15814]
  • homogeneous transport in one, two and three dimensions in Cartesian and spherical domains; a shallow ... examples are implemented out of the library tree. Regardless of the differences in the problem...
  • ofw

  • Referenced in 4 articles [sw10549]
  • often needed to help reduce the dimension of the variable space while optimizing the classification ... multiclass classifiers such as classification and regression trees and support vector machines. Furthermore, a weighted...
  • rerf

  • Referenced in 1 article [sw35480]
  • Random Forests create axis-parallel, or orthogonal trees. That is, the feature space is recursively ... classes seem inseparable along any single dimension, Random Forests may be suboptimal. To address this ... Forest-RC combines features at the per tree level whereas RerF takes linear combinations...
  • Phast4Windows

  • Referenced in 1 article [sw13421]
  • from hidden to visible through the data tree of the interface. Model features are visualized ... zoom, pan, and rotate features in three dimensions (3D). PHAST simulates single phase, constant density...