# Polynomial

Xem 1-20 trên 293 kết quả Polynomial
• ### Đề tài " Rigidity for real polynomials "

We prove the topological (or combinatorial) rigidity property for real polynomials with all critical points real and nondegenerate, which completes the last step in solving the density of Axiom A conjecture in real one-dimensional dynamics. Contents 1. Introduction 1.1. Statement of results 1.2. Organization of this work 1.3. General terminologies and notation 2. Density of Axiom A follows from the Rigidity Theorem 3. Derivation of the Rigidity Theorem from the Reduced Rigidity Theorem

• ### Đề tài "Bounds for polynomials with a unit discrete norm "

Let E be the set of N equidistant points in (−1, 1) and Pn (E) be the set of all polynomials P of degree ≤ n with max{|P (ζ)|, ζ ∈ E} ≤ 1. We prove that π Kn,N (x) = max |P (x)| ≤ C log , √ N P ∈Pn (E) arctan n r2 − x2 |x| ≤ r := 1 − n2 /N 2 where n

• ### Đề tài "Gr¨obner geometry of Schubert polynomials "

Given a permutation w ∈ Sn , we consider a determinantal ideal Iw whose generators are certain minors in the generic n × n matrix (ﬁlled with independent variables). Using ‘multidegrees’ as simple algebraic substitutes for torus-equivariant cohomology classes on vector spaces, our main theorems describe, for each ideal Iw : • variously graded multidegrees and Hilbert series in terms of ordinary and double Schubert and Grothendieck polynomials;

• ### Báo cáo khoa học: "Fast, Space-Efﬁcient, non-Heuristic, Polynomial Kernel Computation for NLP Applications"

We present a fast, space efﬁcient and nonheuristic method for calculating the decision function of polynomial kernel classiﬁers for NLP applications. We apply the method to the MaltParser system, resulting in a Java parser that parses over 50 sentences per second on modest hardware without loss of accuracy (a 30 time speedup over existing methods). The method implementation is available as the open-source splitSVM Java library.

• ### Examples of Applications of The Power Series Method By Solution of Differential Equations with Polynomial Coefﬁcients Calculus 3c-4

Tham khảo sách 'examples of applications of the power series method by solution of differential equations with polynomial coefﬁcients calculus 3c-4', khoa học tự nhiên, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

• ### Báo cáo khoa học: "A Polynomial-Time Fragment of Dominance Constraints"

Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisﬁability problem is known to be NP-complete. Here we identify the natural fragment of normal dominance constraints and show that its satisﬁability problem is in deterministic polynomial time.

• ### Báo cáo " Local polynomial convexity of union of two graphs with CR isolated singularities"

We give sufficient conditions so that the union of two graphs with CR isolated singularities in C2 is locally polynomially convex at a singularly point. Using this result and some ideas in previous work, we obtain a new result about local approximation continuous function. 1. Introduction ˆ We recall that for a given compact K in Cn , by K we denote the polynomial convex hull of K i.e., ˆ K = {z ∈ Cn : |p(z)| ≤ p K for every polynomial p in Cn }. ˆ We say that K is polynomially convex if K = K ....

• ### Báo cáo " POLYNOMIAL APPROXIMATION ON POLYDISKS "

In this paper we give results about polynomial approximation on the closed polydisk in Cn . 1. Introduction Let X be a compact subset of Cn . By C(X) we denote the space of all continuous complex-valued functions on X, with norm f X = max{|f (z)| : z ∈ X}, and let P (X) denote the closure of set of polynomials in C(X). The polynomially convex hull of X will ˆ be denoted by X and diﬁned by ˆ X = {z ∈ Cn : |p(z)| p X for every polynomial p}.

• ### Báo cáo khoa học: "An Approximate Approach for Training Polynomial Kernel SVMs in Linear Time"

count instead of explicitly combines features. By setting with polynomial kernel degree (i.e., d), different number of feature conjunctions can be imKernel methods such as support vector maplicitly computed. In this way, polynomial kernel chines (SVMs) have attracted a great deal SVM is often better than linear kernel which did of popularity in the machine learning and not use feature conjunctions. However, the training natural language processing (NLP) comand testing time costs for polynomial kernel SVM munities. ...

• ### Báo cáo khoa học: "PARALLEL MULTIPLE CONTEXT-FREE GRAMMARS, FINITE-STATE TRANSLATION SYSTEMS, AND POLYNOMIAL-TIME RECOGNIZABLE SUBCLASSES OF LEXICAL-FUNCTIONAL GRAMMARS"

A number of grammatical formalisms were introduced to define the syntax of natural languages. Among them are parallel multiple context-free grammars (pmcfg's) and lexical-functional grammars (lfg's). Pmcfg's and their subclass called multiple context-free grammars (mcfg's) are natural extensions of cfg's, and pmcfg's are known to be recognizable in polynomial time. Some subclasses of lfg's have been proposed, but they were shown to generate an AlP-complete language. Finite state translation systems (fts') were introduced as a computational model of transformational grammars. ...

• ### Báo cáo khoa học: "A Polynomial-Time Algorithm for Statistical Machine Translation"

We introduce a polynomial-time algorithm for statistical machine translation. This algorithm can be used in place of the expensive, slow best-first search strategies in current statistical translation architectures. The approach employs the stochastic bracketing transduction grammar (SBTG) model we recently introduced to replace earlier word alignment channel models, while retaining a bigram language model. The new algorithm in our experience yields major speed improvement with no significant loss of accuracy. ...

• ### Báo cáo khoa học: "Polynomial Learnability and Locality of Formal Grammars"

We apply a complexity theoretic notion of feasible learnability called "polynomial learnabillty" to the evaluation of grammatical formalisms for linguistic description. We show that a novel, nontriviai constraint on the degree of ~locMity" of grammars allows not only context free languages but also a rich d ~ s of mildy context sensitive languages to be polynomiaily learnable. We discuss possible implications, of this result t O the theory of naturai language acquisition.

• ### Báo cáo khoa học: "POLYNOMIAL TIME PARSING OF COMBINATORY CATEGORIAL GRAMMARS*"

In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating a representation of the parse trees has two phases. Initially, a shared forest is build that encodes the set of all derivation trees for the input string. This shared forest is then pruned to remove all spurious ambiguity.

• ### Báo cáo hóa học: "Research Article ISAR Imaging of Ship Target with Complex Motion Based on New Approach of Parameters Estimation for Polynomial Phase Signal"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article ISAR Imaging of Ship Target with Complex Motion Based on New Approach of Parameters Estimation for Polynomial Phase Signal

• ### Báo cáo hóa học: " Research Article A Study on the p-Adic q-Integral Representation on p Associated with the Weighted q-Bernstein and q-Bernoulli Polynomials"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article A Study on the p-Adic q-Integral Representation on p Associated with the Weighted q-Bernstein and q-Bernoulli Polynomials

• ### báo cáo hóa học:" Research Article A Study on the p-Adic Integral Representation on Zp Associated with Bernstein and Bernoulli Polynomials"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article A Study on the p-Adic Integral Representation on Zp Associated with Bernstein and Bernoulli Polynomials

• ### Báo cáo hóa học: "Research Article On the Derivatives of Bernstein Polynomials: An Application for the Solution of High Even-Order Differential Equations"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article On the Derivatives of Bernstein Polynomials: An Application for the Solution of High Even-Order Differential Equations

• ### Báo cáo hóa học: " Adaptive Local Polynomial Fourier Transform in ISAR"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Adaptive Local Polynomial Fourier Transform in ISAR

• ### Đề tài "Annals of Mathematics Lehmer’s problem for polynomials with odd coefficients "

We prove that if f (x) = n−1 ak xk is a polynomial with no cyclotomic k=0 factors whose coeﬃcients satisfy ak ≡ 1 mod 2 for 0 ≤ k 1 + log 3 , 2n resolving a conjecture of Schinzel and Zassenhaus [21] for this class of polynomials. More generally, we solve the problems of Lehmer and Schinzel and Zassenhaus for the class of polynomials