Takahashi, K., Fujiyoshi, A., Kasai, T.: A polynomial time algorithm to infer se- quential machines. Systems and Computers in Japan 34(1), 59-67 (2003)K. Takahashi, A. Fujiyoshi, and T. Kasai. A polynomial time algorithm to infer sequential machines. Systems and Computers in Japan...
The point-valued expression of a polynomial A(x)A(x) with degA<ndegA<n is a set of nn points: {(x0,y0),(x1,y1),⋯,(xn−1,yn−1)}{(x0,y0),(x1,y1),⋯,(xn−1,yn−1)} We can use nn evaluations to convert a coefficient expression to a point-valued expressio...
In [33], Guha and Khuller first proposed two polynomial time algorithms to construct a CDS in a general graph G. These algorithms are greedy and centralized. The first one has an approximation ratio of 2(H(Δ)+1), where H is a harmonic function. The idea of this algorithm is to buil...
This article proposes a polynomial-time algorithm for convex quadratic optimization subject to linear inequalities. The running time of the algorithm is polynomial in the binary size of the input data and in the logarithm of the reciprocal of the given accuracy....
and then executing two next pointer maneuvers. Figure 2.3.3 Insertion from a linked list The special case ofadding to the frontorremoving the first itemis thus aconstanttime operation, presuming of course that a link to the front of the linked list is maintained. The special case ofadding ...
As observed in real-world social networks51,52, the evolution of the community structure in the network includes the occasional merger of two or more existing communities to form a new community. Usually, these merging events stem from the creation of new connections between individuals in the ne...
Bruynooghe, "A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics," Annals of Mathematics and Artificial Intelligence, vol. 69, no. 4, pp. 343-376, 2013.Leander Schietgat , Jan Ramon , Maurice Bruynooghe, A polynomial-time maximum ...
Nth roots are also used in computer science and cryptography, which helps to create safe algorithms and effective data processing methods. The basis for exponential growth and decay functions, polynomial expressions, and the idea of dimensions are provided by Nth power, which is crucial in algebra...
A polynomial time algorithm to approximate the mixed volume within a simply exponential factor 来自 钛学术 喜欢 0 阅读量: 11 发明人: L Gurvits 摘要: Let ${\bf K} = (K_1, ..., K_n)$ be an $n$-tuple of convex compact subsets in the Euclidean space $\R^n$, and let $V(\...
Additionally, they propose a line search optimization approach based on iterative majorization and polynomial fitting. Zhang et al. (2013) propose an extension of the tri-factor non-negative matrix factorization model (Ding et al. 2006) to a tensor decomposition model performing adaptive ...