• redbKIT

  • Referenced in 255 articles [sw12977]
  • algorithms and proper orthogonal decomposition techniques, investigate their approximation properties and analyze offline-online decomposition...
  • CALMA

  • Referenced in 109 articles [sw03235]
  • constraint satisfaction, and approximation techniques including a variety of local search methods, genetic algorithms, neural...
  • KELLEY

  • Referenced in 643 articles [sw04829]
  • second part of the book, which is approximately 50 pages long, deals with the optimization ... technique due to the author and his group. Implicit filtering methods use finite difference approximations...
  • Tyrolean

  • Referenced in 91 articles [sw07830]
  • successor of TTT. Current (non-)termination techniques include: approximated dependency graph, argument filtering, bounds, dependency...
  • ORBIT

  • Referenced in 39 articles [sw20552]
  • polynomial models considered by present techniques. Approximation guarantees are obtained by ensuring that a subset...
  • NLEIGS

  • Referenced in 34 articles [sw22547]
  • also features low-rank approximation techniques for increased computational efficiency. Small- and large-scale numerical...
  • OPQ

  • Referenced in 442 articles [sw11881]
  • Orthogonal polynomials. Computation and approximation. Orthogonal polynomials are a widely used class of mathematical functions ... first time, a systematic development of computational techniques, including a suite of computer programs...
  • NeNMF

  • Referenced in 34 articles [sw17586]
  • powerful matrix decomposition technique that approximates a nonnegative matrix by the product...
  • PROC NLMIXED

  • Referenced in 70 articles [sw11039]
  • first-order Taylor series approximation. A variety of alternative optimization techniques are available to carry ... results in parameter estimates along with their approximate standard errors based on the second derivative...
  • Church

  • Referenced in 55 articles [sw08946]
  • Church program, exactly and approximately, using Monte Carlo techniques...
  • ADVI

  • Referenced in 27 articles [sw34040]
  • Stan. Variational inference is a scalable technique for approximate Bayesian inference. Deriving variational inference algorithms...
  • BPKit

  • Referenced in 22 articles [sw05807]
  • blocks. These include a number of approximate inverse techniques. By combining a global and local...
  • Flow*

  • Referenced in 28 articles [sw20162]
  • well-known Taylor model arithmetic techniques for guaranteed approximations of the continuous dynamics in each...
  • MFDMtool

  • Referenced in 11 articles [sw11495]
  • formulas, equations as well as local approximation technique and numerical integration schemes are discussed there...
  • SMOTE

  • Referenced in 152 articles [sw34239]
  • SMOTE: Synthetic Minority Over-sampling Technique. An approach to the construction of classifiers from imbalanced ... imbalanced if the classification categories are not approximately equally represented. Often real-world data sets...
  • Venture

  • Referenced in 10 articles [sw14670]
  • built out of scalable exact and approximate techniques. We also describe four key aspects...
  • WORHP

  • Referenced in 20 articles [sw10824]
  • Goldfarb and Shanno (BFGS) update techniques for Hessian approximations, and sparse linear algebra. Furthermore...
  • UMAP

  • Referenced in 30 articles [sw34900]
  • UMAP (Uniform Manifold Approximation and Projection) is a novel manifold learning technique for dimension reduction...
  • ANF

  • Referenced in 14 articles [sw12276]
  • graph (268K nodes), ANF’s highly-accurate approximation is more than 700 times faster than ... this drill-down, ANF employs new techniques for approximating neighbourhood-type functions for graphs with...
  • TRACE-DDE

  • Referenced in 30 articles [sw12801]
  • pseudospectral differentiation techniques in order to get numerical approximations of the relevant characteristic eigenvalues. This...