If the ratio of vertex not belongs to any wheel complete multipartite graph is no more than \\(\\beta <1\\), then our algorithm will provide a \\((1+\\beta +\\frac{1-\\beta }{k})\\)-approximation, where k is a parameter related to degree distribution of wheel complete ...
摘要: IQ-TREE is a efficient program for large phylogenetic tree reconstruction from molecular sequences. It is a subtantially improved version of the IQPNNI algorithm (Vinh and von Haeseler, 2004) with extensively more features such as the ultra-fast bootstrap年份: 2012 ...
algorithmVertexcoverConflictgraphCompletemultipartitegraphConflict graph is a union of finite given sets of disjoint complete multipartite graphs. Vertex cover on this kind of graph is used first to model data inconsistency problems in database application. It is NP-complete if the number of given ...
renormalization scalediagonal Pade approximantsdiagonal Baker-Gammel approximantsAn approximation algorithm is proposed to transform truncated QCD (or QED) series for observables. The approximation is a modification of the Baker-Gammel approximants, and is independent of the renormalization scale (RSci) ...
doi:10.1007/978-3-319-98355-4_10These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.D'Andrea, AnnalisaForlizzi, LucaProietti, Guido...
The learning algorithm automatically selects the optimal number of components and avoids several drawbacks of the standard Expectation-Maximization algorithm, including the sensitivity to initialization and possible convergence to the boundary of the parameter space. We demonstrate the effectiveness and ...
Moreover, an example of two (,)-generalized hybrid set-valued mappings which have a common strongly attractive point is shown. Then we finish the work using the proposed algorithm to find a common element of the set of solutions of an equilibrium problem and the sets of fixed points of ...