• Blossom IV

  • Referenced in 36 articles [sw04781]
  • blossom algorithm for solving minimum-weight perfect-matching problems and we present computational results ... multiple search trees with an individual dual-change $varepsilon$ for each tree. As a benchmark ... Pentium-Pro computer takes approximately 3 minutes...
  • TreeCANN

  • Referenced in 2 articles [sw27578]
  • Tree Coherence Approximate Nearest Neighbor Algorithm. TreeCANN is a fast algorithm for approximately matching ... matching patch candidates between the two images and then propagating good matches to neighboring patches ... methods. Seed matching is achieved using a properly tuned k-d tree on a sparse...
  • SAPPER

  • Referenced in 5 articles [sw18894]
  • SAPPER: subgraph indexing and approximate matching in large graphs. With the emergence of new applications ... database graph, we investigate the problem of approximate subgraph indexing, i.e., finding the occurrences ... takes advantage of pre-generated random spanning trees and a carefully designed graph enumeration order...
  • RACOONWW

  • Referenced in 4 articles [sw09550]
  • double-pole approximation. The calculation of the tree-level processes ... factorizable virtual corrections in double-pole approximation, and the real corrections are based ... matrix elements for e+e−→4fγ. The matching of soft and collinear singularities between virtual...
  • CGAL

  • Referenced in 362 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CoCoA

  • Referenced in 634 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • COLAMD

  • Referenced in 29 articles [sw00145]
  • Two codes are discussed, COLAMD and SYMAMD, that...
  • Coq

  • Referenced in 1818 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

  • Referenced in 200 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • DEA

  • Referenced in 242 articles [sw00194]
  • Data Envelopment Analysis (DEA) is becoming an increasingly...
  • Elkhound

  • Referenced in 8 articles [sw00236]
  • The Generalized LR (GLR) parsing algorithm is attractive...
  • GAP

  • Referenced in 2948 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • gmp

  • Referenced in 272 articles [sw00363]
  • GMP is a free library for arbitrary precision...
  • HSL

  • Referenced in 274 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • KNITRO

  • Referenced in 180 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LAPACK

  • Referenced in 1647 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LEDA

  • Referenced in 261 articles [sw00509]
  • In the core computer science areas -- data structures...