• Blossom IV

• Referenced in 36 articles [sw04781]
• Computing minimum-weight perfect matchings. We make several observations on the implementation of Edmonds’ blossom ... algorithm for solving minimum-weight perfect-matching problems and we present computational results for geometric...

• Blossom V

• Referenced in 28 articles [sw04780]
• implementation of a minimum cost perfect matching algorithm We describe a new implementation ... Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer...

• PSP

• Referenced in 33 articles [sw07589]
• dependent number of grid points per perfectly matched layer. Several computational and memory improvements...

• clique

• Referenced in 33 articles [sw07590]
• dependent number of grid points per perfectly matched layer. Several computational and memory improvements...

• two loop amplitudes

• Referenced in 25 articles [sw25063]
• need for regulation. These results perfectly match the all-loop BCFW recursion relations, to which...

• Blossom-Quad

• Referenced in 14 articles [sw41267]
• mesh generator using a minimum cost perfect matching algorithm. A new indirect way of producing ... algorithm, that computes the minimum-cost perfect matching in a graph in polynomial time...

• FDFD

• Referenced in 10 articles [sw01172]
• volume is terminated by an anisotropic perfectly matched layer region that simulates an infinite domain...

• Dymola

• Referenced in 54 articles [sw06285]
• ready made model libraries to better match users unique modeling and simulation needs. The flexibility ... makes it a versatile tool which is perfect for modeling and simulation of new alternative...

• Hypothesis-checker

• Referenced in 2 articles [sw34855]
• Gregor, T. Novotný, R. Škrekovski: ”Extending perfect matchings to Gray codes with prescribed ends ... hypercube. Fink showed that every perfect matching in the n-dimensional hypercube ... problem. Namely, we characterize when a perfect matching in Qn extends to a Hamiltonian path ... parity. Furthermore, we characterize when a perfect matching in Qn with two faulty vertices extends...

• PatMaN

• Referenced in 4 articles [sw29584]
• driven program implements a non-deterministic automata matching algorithm on a keyword tree ... searched. Search time is short for perfect matches, and retrieval time rises exponentially with...

• PHRAP

• Referenced in 2 articles [sw17332]
• sequences by searching for pairs of perfectly matching “words” or sequence regions that meet certain...

• miRanalyzer

• Referenced in 2 articles [sw29579]
• annotated in miRBase, (ii) finds all perfect matches against other libraries of transcribed sequences...

• LineCast

• Referenced in 1 article [sw22029]
• number of receivers. The proposed LineCast matches perfectly with the line scanning cameras that ... large number of receivers reach the qualities matching their channel conditions. Our theoretical analysis shows...

• SNV-PPILP

• Referenced in 2 articles [sw23968]
• violations of the perfect phylogeny assumption. We always match or improve the accuracy of GATK...

• VISA

• Referenced in 1 article [sw16230]
• decisions where no option matches all of the criteria perfectly; or for decisions where more...

• MYSTIQ

• Referenced in 12 articles [sw09439]
• numbers of data sources of less than perfect quality. There are many reasons ... violate some global integrity constraints; fuzzy matches between objects from different sources may return false...

• IMEx

• Referenced in 3 articles [sw14942]
• efficiently screen genome sequences for microsatellites (perfect as well as imperfect), we developed ... Imperfect Microsatellite Extractor). IMEx uses simple string-matching algorithm with sliding window approach to screen...

• CodeBLEU

• Referenced in 1 article [sw40139]
• syntactic and semantic features of codes, and perfect accuracy is too strict thus it underestimates ... strength of BLEU in the n-gram match and further injects code syntax via abstract...

• DeepReID

• Referenced in 2 articles [sw30750]
• identification. Person re-identification is to match pedestrian images from disjoint camera views detected ... manually cropped pedestrian images and assume perfect detection. In this paper, we propose a novel...

• libTextCat

• Referenced in 1 article [sw24541]
• known to perform with near-perfect accuracy. The central idea of the Cavnar & Trenkle technique ... known. The categories of the closest matches are output as the classification. A fingerprint...