• LIBSVM

  • Referenced in 1124 articles [sw04879]
  • optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail...
  • KELLEY

  • Referenced in 617 articles [sw04829]
  • problems. The style of the book is probably best described by the following quote from...
  • SIFT

  • Referenced in 611 articles [sw16554]
  • feature can be correctly matched with high probability against a large database of features from...
  • Chaff

  • Referenced in 574 articles [sw06916]
  • efficient SAT solver. Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant...
  • GloptiPoly

  • Referenced in 311 articles [sw04343]
  • algebra, Fourier analysis, functional analysis, operator theory, probability and statistics, to cite ... applications in various fields such as optimization, probability, finance, control, signal processing, chemistry, cristallography, tomography ... data. Many important applications in e.g. optimization, probability, financial economics and optimal control...
  • symrcm

  • Referenced in 383 articles [sw08566]
  • probably takes less time to compute than...
  • sn

  • Referenced in 318 articles [sw08059]
  • Skew-t. Build and manipulate probability distributions of the skew-normal family and some related...
  • gamair

  • Referenced in 299 articles [sw11132]
  • prerequisite is an honest course in probability and statistics. Finally, let us note that...
  • Walksat

  • Referenced in 207 articles [sw04328]
  • assignment, or with some probability picks a variable at random. WalkSAT first picks a clause ... previously satisfied clauses becoming unsatisfied, with some probability of picking one of the variables...
  • Stan

  • Referenced in 195 articles [sw10200]
  • Stan: A C++ Library for Probability and Sampling. Stan is a probabilistic programming language implementing...
  • MCQueue

  • Referenced in 140 articles [sw05198]
  • module calculates performance measures including queue-length probabilities and waiting-time probabilities for basic queueing...
  • NTRU

  • Referenced in 167 articles [sw11761]
  • with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem...
  • tsbridge

  • Referenced in 165 articles [sw12354]
  • applied to calculate posterior model probabilities for a variety of time series Bayesian models, where...
  • CAViaR

  • Referenced in 162 articles [sw04424]
  • Utilizing the criterion that each period the probability of exceeding the VaR must be independent...
  • mvtnorm

  • Referenced in 141 articles [sw04359]
  • Distributions , Computes multivariate normal and t probabilities, quantiles, random deviates and densities...
  • QSIMVN

  • Referenced in 141 articles [sw32329]
  • paper ”Numerical Computation of Multivariate Normal Probabilities”, in J. of Computational and Graphical Stat...
  • ProbLog

  • Referenced in 85 articles [sw06945]
  • briefly ProbLog, focusses on computing the success probability of a given query, either exactly ... ProbLog2 allows the user to compute marginal probabilities of any number of ground atoms ... presence of evidence (in comparison, the succes probability setting of ProbLog1 corresponds to having...
  • LMOMENTS

  • Referenced in 130 articles [sw07868]
  • useful in the summarization and estimation of probability distributions. This report contains details of Fortran...
  • AutoClass

  • Referenced in 68 articles [sw26092]
  • describe our classes in terms of probability distribution or density functions, and the locally maximal ... posterior probability parameters. We rate our classifications with an approximate posterior probability of the distribution ... computational complexity of the joint probability, and our marginalization is w.r.t. a local maxima ... parameter space. This posterior probability rating allows direct comparison of alternate density functions that differ...
  • HOMPACK

  • Referenced in 121 articles [sw05324]
  • almost all starting points, i.e., with probability one. The essence of all such algorithms...