• # 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...