A short note on matching algorithms - Derigs - 1986 () Citation Context ...cond difficulty is that existing sum matching algorithms are considerably slower than the CMP algorithm. To the authors' knowledge, the most recent version of Edmonds' algorithm is due to Derigs ([5],=-=[6]-=-...
In this short note we prove that, given two (not necessarily binary) rooted phylogenetic trees T_1, T_2 on the same set of taxa X, where |X|=n, the hybridization number of T_1 and T_2 can be computed in time O^{*}(2^n) i.e. O(2^{n} poly(n)). The result also means...
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang. Note, that the approximability lower... KA Jaroslaw Byrka 被引量: 14发表: 2009年 加载更多来源...
The PSLQ algorithm is one of the most popular algorithm for finding nontrivial integer relations for several real numbers. In the present work, we present an incremental version of PSLQ. For some applications needing to call PSLQ many times, such as finding the minimal polynomial of an ...
R. B. Brent,An algorithm with guaranteed convergence for finding a zero of a function, Computer Journal, Vol. 14–4 (Apr. 1971). pp. 422–425. Article Google Scholar J. C. P. Bus and T. J. Dekker,Two efficient algorithms with guaranteed convergence for finding a zero of a function...
Short NoteA Note on the Efficiency of an Interval Routing Algorithm An interval routing algorithm for general networks has been proposed separately by Santoro and Khatib and van Leeuwen and Tan. It works optimally for various regular networks, and for the non-regular case it never chooses a rout...
The split-step method is based on applying a phase-shift correction to the extrapolated wavefield, a correction that attempts to compensate for the lateral velocity varia- tions. I show how to extend DSR prestack migration to lateral velocity media and exemplify the method by applying the new ...
In this note, we show a mathematical error in paper ("An improved initial basis for the simplex algorithm" (Junior HV, Lins MPE. An improved initial basis for the simplex algorithm. Computers and Operations Research 2005; 32: 1983–1993), and then offer a modified method using LU decomposit...
Handing this feature engineering over to the algorithm in its entirety poses something of a double-edged sword: CNNs automatically detect features, features we know we wanted as well as the ones we didn’t know we needed, but it also means we get the features we never wanted and shouldn’...
Note 🚧 Because of the algorithm's design, multiple IDs can decode back into the same sequence of numbers. If it's important to your design that IDs are canonical, you have to manually re-encode decoded numbers and check that the generated ID matches. Encoding & decoding just one number...