منابع مشابه
Iteration Trees
large cardinal hypothesis used to prove I1~+1 determinacy in [MS] cannot be substantially improved. Our theorem is an application of the theory of core models or canonical inner models for large cardinal hypotheses. Our work develops further some of the basic ideas of this theory. The theory itself has many other applications, particularly in the realm of relative consistency results. (As a quo...
متن کاملA Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian Binary Trees
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems.
متن کاملAutomata Iteration
This paper considers the problem of computing the real convex hull of a finite set of ndimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The conv...
متن کاملMunchausen Iteration
We present a method for solving polynomial equations over idempotent ω-continuous semirings. The idea is to iterate over the semiring of functions rather than the semiring of interest, and only evaluate when needed. The key operation is substitution. In the initial step, we compute a linear completion of the system of equations that exhaustively inserts the equations into one another. With func...
متن کاملPipeline Iteration
This paper presents pipeline iteration, an approach that uses output from later stages of a pipeline to constrain earlier stages of the same pipeline. We demonstrate significant improvements in a state-of-the-art PCFG parsing pipeline using base-phrase constraints, derived either from later stages of the parsing pipeline or from a finitestate shallow parser. The best performance is achieved by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 1994
ISSN: 0894-0347
DOI: 10.2307/2152720