In this paper, we present a novel approach to combine the outputs of multiple MT engines into a consensus translation. In contrast to previous Multi-Engine Machine Translation (MEMT) techniques, we do not rely on word alignments of output hypotheses, but prepare the input sentence for multi-engine processing. We do this by using a recursive decomposition algorithm that produces simple chunks as...

This paper develops low-complexity adaptive receivers for space-time block-coded (STBC) transmissions over frequency-selective fading channels. The receivers are useful for equalization purposes for single user transmissions and for joint equalization and interference cancellation for multiuser transmissions. The receivers exploit the rich code structure of STBC codes in order to deliver recurs...

We develop an efficient adaptive receiver for joint equalization and interference cancellation for multi–user space–time block– coded transmissions. The receiver exploits the code structure and allows multiple user transmissions over frequency–selective fading channels with reduced complexity and lower system overhead. The adaptation scheme is based on a recursive least–squares implementation f...

This paper develops a model for precisely defining how an agent interacts with objects in its environment through the use of its capabilities. Capabilities are recursively defined in terms of lower-level capabilities and actions, which represent atomic interactions with the environment. Actions are used to represent both sensors and effectors. The paper shows how the model can be used to repres...

In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. While nearly tight upper and lower bounds are known in the case when the strategy set is finite, much less is known when there is an infinite strategy set. Here we consider the case when the set of strategies is a subset...

This paper discusses a perception-based theory for a multi-variate stopping problem with a monotone rule by Yasuda et al. (1982). The problem is developed by using the perceptive analysis of the previous work(Kurano et al. (2004)). We will show a recursive equation which determines the perceptive value of its equilibrium point for the model.

In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we found explicit formulae for the Tutte polynomials of any multi-bridge graph and some 2−tree graphs. Further, several recursive formulae for other graphs such as the fan and the wheel graphs are also discussed.

We describe a novel recursive lter design technique for multi-scale \pyramid" transforms. The recursion in the design technique follows that of the pyramid construction, and allows us to solve a reduced design problem at each step. We demonstrate the use of this technique by designing lters of various orientation bandwidths for use in a \steerable pyramid" image transform.1

A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform (including all one and multi-dimensional Discrete Fourier Transforms). An important instance of the construction identifies an iteration and specialisation of the Maiorana-McFarland (MM) construction.