• ARPACK

  • Referenced in 719 articles [sw04218]
  • operations. This software is based upon an algorithmic variant of the Arnoldi process called...
  • AdaBoost.MH

  • Referenced in 393 articles [sw08517]
  • problems. We show how the resulting learning algorithm can be applied to a variety ... update technique to derive a new boosting algorithm. This boosting algorithm does not require ... about the performance of the weak learning algorithm. We also study generalizations ... boosting algorithm to the problem of learning functions whose range, rather than being binary...
  • JDQR

  • Referenced in 438 articles [sw04021]
  • Matlab® implementation of the JDQR algorithm. The JDQR algorithm can be used for computing ... complex, Hermitian or non-Hermitian, .... The algorithm is effective especially in case A is sparse...
  • mftoolbox

  • Referenced in 370 articles [sw23743]
  • contains implementations of many of the algorithms described in the book. The book ... intended to facilitate understanding of the algorithms through MATLAB experiments, to be useful for research ... plain vanilla” versions; they contain the core algorithmic aspects with a minimum of inessential code ... progress of an iteration. For the iterative algorithms a convergence tolerance is hard-coded...
  • minpack

  • Referenced in 633 articles [sw05310]
  • raised in the first part by discussing algorithms for unconstrained optimization. Because the discussion...
  • Simulink

  • Referenced in 618 articles [sw04348]
  • range of tools that let you develop algorithms, analyze and visualize simulations, create batch processing...
  • Knapsack

  • Referenced in 422 articles [sw04723]
  • respect to relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results ... actual performance of the most effective algorithms published...
  • CGAL

  • Referenced in 300 articles [sw00118]
  • easy access to efficient and reliable geometric algorithms in the form of a C++ library ... using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms ... ridges and umbilics), alpha shapes, convex hull algorithms (in 2D, 3D and dD), search structures ... data structures. All these data structures and algorithms operate on geometric objects like points...
  • Chaff

  • Referenced in 540 articles [sw06916]
  • variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development...
  • SPEA2

  • Referenced in 383 articles [sw06686]
  • SPEA2 - The Strength Pareto Evolutionary Algorithm 2: SPEA2 in an elitist multiobjective evolutionary algorithm...
  • SDPT3

  • Referenced in 522 articles [sw04009]
  • improve the efficiency and stability of the algorithm are incorporated. For example, step-lengths associated...
  • SparseMatrix

  • Referenced in 517 articles [sw04629]
  • development and performance evaluation of sparse matrix algorithms. It allows for robust and repeatable experiments...
  • SIFT

  • Referenced in 513 articles [sw16554]
  • known objects using a fast nearest-neighbor algorithm, followed by a Hough transform to identify...
  • BRENT

  • Referenced in 353 articles [sw14021]
  • BRENT Algorithms for Minimization Without Derivatives. BRENT is a C library which contains algorithms...
  • GQTPAR

  • Referenced in 282 articles [sw07451]
  • trust region step We propose an algorithm for the problem of minimizing a quadratic function ... ellipsoidal constraint and show that this algorithm is guaranteed to produce a nearly optimal solution ... also consider the use of this algorithm in a trust region Newton’s method ... which is a Fortran implementation of our algorithm, show that GQTPAR is quite successful...
  • LSQR

  • Referenced in 303 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems. An iterative method is given ... comparing LSQR with several other conjugate-gradient algorithms, indicating that LSQR is the most reliable ... algorithm when A is ill-conditioned...
  • LINPACK

  • Referenced in 461 articles [sw04209]
  • least-squares problems. LINPACK uses column-oriented algorithms to increase efficiency by preserving locality...
  • SVMlight

  • Referenced in 240 articles [sw04076]
  • learning a ranking function. The optimization algorithms used in SVMlight are described in [Joachims, 2002a ... Joachims, 1999a]. The algorithm has scalable memory requirements and can handle problems with many thousands ... 2002a]. New in this version is an algorithm for learning ranking functions [Joachims, 2002c ... recommender systems. Futhermore, this version includes an algorithm for training large-scale transductive SVMs...
  • glasso

  • Referenced in 249 articles [sw07432]
  • alternatives. The graphical lasso [5] is an algorithm for learning the structure in an undirected ... explain this behavior, and propose new algorithms that appear to outperform glasso. By studying ... precision matrix Θ. We propose similar primal algorithms p-glasso and dp-glasso, that also ... optimization target. We study all of these algorithms, and in particular different approaches to solving...
  • ALGOL 60

  • Referenced in 420 articles [sw21807]
  • ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family...