The search for the optimal word sequence can be performed efficiently even in a speech recognizer with a very large vocabulary and complex models. This is achieved using pruning methods with empirically chosen parameters and the willingness to accept a certain amount of pruning errors. Quite unsatisfying though, it is state-of-the-art that such pruning errors are not directly detected but, inst...

Let A be a subset of F p , the field of p elements with p prime. We let A + A = {a + b : a ∈ A, b ∈ A}, and AA = {ab : a ∈ A, b ∈ A}. It is fun (and useful) to prove lower bounds on max(|A+A|, |AA|) (see e.g. [BKT],[BGK],[G]). Recently, Garaev [G] showed that when |A| < p 1 2 one has the estimate max(|A + A|, |AA|) |A| 15 14. By using Plunneke's inequality in a slightly more sophisticated way, ...

Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a Beta(3/2, 1/2)coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous’s continuumrandom tree, to construct a continuous state space process that has the same structure as the beta-coalescent process up to some time chan...

Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a β( 3 2 , 1 2 )-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous’s continuum random tree, to construct a continuous state space process that has the same structure as the β-coalescent process up to some time chang...

OBJECTIVE The concept of vascular pruning, the "cuting-off" of vessels, is gaining importance due to expansion of angio-modulating therapies. The proangiogenic effects of vascular endothelial growth factor (VEGF) are broadly described, but the mechanisms of structural alterations by its downregulation are not known. METHODS AND RESULTS VEGF(165)-releasing hydrogels were applied onto the chick...

Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined to not lie on an optimal path. We introduce an ε-pruning condition that extends pruning to include a possible error in the pruning step. This results in a greater reduction of the computation ...

Pre-Pruning and Post-Pruning are two standard methods of dealing with noise in concept learning. Pre-Pruning methods are very efficient, while Post-Pruning methods typically are more accurate, but much slower, because they have to generate an overly specific concept description first. We have experimented with a variety of pruning methods, including two new methods that try to combine and integ...

Overtting is a widely observed pathology of induction algorithms. For induction algorithms that build decision trees, pruning is a common approach to correct overtting. Most common pruning techniques , do not account for one potentially important factor | multiple comparisons. Multiple comparisons occur whenever an induction algorithm examines several candidate models and selects the one that b...

In this paper we introduce a well-motivated abstract pruning criterion for LVCSR decoders based on the anticipated recombination of HMM state alignment paths. We show that several heuristical pruning methods common in dynamic network decoders are approximations of this pruning criterion. The abstract criterion is too complex to be applied directly in an efficient manner, so we derive approximat...