• SuiteSparseQR

  • Referenced in 27 articles [sw07348]
  • Next, the fill-reducing ordering, column elimination tree, and frontal matrix structures are found without...
  • CS-Prolog

  • Referenced in 7 articles [sw00171]
  • PROLOG uses four rules: variable elimination, tree rewriting, equation anteposition and back substitution. A domain...
  • GRAGRA

  • Referenced in 3 articles [sw16822]
  • initial mesh, generating element matrices and elimination trees for interfacing with direct solver algorithm...
  • Pselinv

  • Referenced in 3 articles [sw25225]
  • exploit the concurrency exposed by the elimination tree associated with the LU factorization...
  • SMOOTH

  • Referenced in 1 article [sw12951]
  • theory, (e.g., graphs, bipartite graphs, permutations, trees, elimination trees, heaps, and others), are encapsulated...
  • Bali-phy

  • Referenced in 9 articles [sw16614]
  • sequence data. Simultaneous estimation eliminates bias toward inaccurate alignment guide-trees, employs more sophisticated substitution...
  • GF

  • Referenced in 32 articles [sw13667]
  • used both for linearizing syntax trees and parsing strings. GF can describe both formal ... have a type system, which helps to eliminate run-time errors in language processing ... used in authoring systems, where syntax trees are constructed in an interactive editor similar...
  • CDT

  • Referenced in 12 articles [sw00116]
  • assignment problem relaxation and on a subtour elimination branching scheme. The effectiveness of the implementation ... with the nodes of the branch-decision tree...
  • tw-heuristic

  • Referenced in 4 articles [sw34759]
  • computing tree decompositions of graphs are heuristics that compute an elimination order, i.e., a permutation...
  • Nenofex

  • Referenced in 18 articles [sw09579]
  • technique for eliminating variables. In contrast to eliminating existentially quantified variables by resolution ... formula in NNF is represented as a tree with structural restrictions in order to keep...
  • TAUCS

  • Referenced in 30 articles [sw04014]
  • degree code for no-fill ordering of tree-structured matrices. All of these are symmetric ... factor the resulting matrix completely. Instead, they eliminate rows and columns which can be eliminated...
  • HARP

  • Referenced in 15 articles [sw26323]
  • more readable by excising redundancies from proof trees. Domain-independent heuristics are formulated to capture ... guide the search for proofs and help eliminate irrelevant premisses...
  • eWAP-mine

  • Referenced in 1 article [sw01470]
  • tree by recursively reconstructing intermediate trees, starting with suffix sequences and ending with prefix sequences ... frequent event and eliminates the need for reconstructing intermediate conditional WAP-trees...
  • TRIOPT

  • Referenced in 6 articles [sw02486]
  • small size, its vertices are eliminated from the available sample set. This changes global information ... based on an entropy cut. The tree adopts flexible breadth depending on the status...
  • Bonsai

  • Referenced in 1 article [sw17699]
  • Bonsai: A GPU Tree-Code. We present a gravitational hierarchical N-body code that ... algorithm are executed on the GPU which eliminates the need for data transfer between ... tests indicate that the gravitational tree-code outperforms tuned CPU code for all parts...
  • PolyAML

  • Referenced in 4 articles [sw08950]
  • Many complexities of the source language are eliminated in this translation, leading to a modular ... points. These labels are organized in a tree structure such that a parent...
  • SNESIM

  • Referenced in 5 articles [sw13366]
  • propose, through the introduction of search trees, an efficient solution to the extraction and storage ... revisited, and solutions are presented to eliminate both memory demand and simulation time limitations. First ... training image and build the search tree, a simple method is described to minimize data...
  • DPillar

  • Referenced in 4 articles [sw14070]
  • millions of servers. The conventional hierarchical tree-based data center network architecture faces several challenges ... symmetric so that any network bottleneck is eliminated at the architectural level. With each server...
  • ROSE

  • Referenced in 4 articles [sw04891]
  • high level to build an abstract syntax tree (AST) that is well suited to source ... translations developed with ROSE are partial redundancy elimination, constant folding, inlining, outlining (separating...
  • PDSDBSCAN

  • Referenced in 1 article [sw30115]
  • capable of discovering arbitrary shaped clusters and eliminating noise data. However, parallelization of DBSCAN ... DBSCAN. In addition, we use a tree-based bottom-up approach to construct the clusters...