As the research in the cursive script recognition goes on, it becomes clear that no single method is likely to provide good enough results. This is due to enormous variety of human handwriting styles. Hence the idea of using a collection of different recognition methods working together referred to as a “toolbox” [4]. It has been observed that combining results of multiple recognizers can produ...

This paper surveys several state-of-the-art reordering techniques employed in Statistical Machine Translation systems. Reordering is understood as the word-order redistribution of the translated words. In original SMT systems, this different order is only modeled within the limits of translation units. Relying only in the reordering provided by translation units may not be good enough in most l...

We present X-Bounds, a new tool to implement a methodology based on stochastic ordering, algorithmic derivation of simpler Markov chains and numerical analysis of these chains. The performance indices defined by reward functions are stochastically bounded by reward functions computed on much simpler or smaller Markov chains obtained after aggregation or simplification. This leads to an importan...

We prove that any concept in any description logic that extendsALC with some features amongst I (inverse),Qk (quantified number restrictions with numbers bounded by a constant k), Self (local reflexivity of a role) can be learnt if the training information system is good enough. That is, there exists a learning algorithm such that, for every concept C of those logics, there exists a training in...

We present a parallel implementation of a map-making algorithm for CMB anisotropy experiments which is both fast and efficient. We show for the first time a Maximum Likelihood, minimum variance map obtained by processing the entire data stream expected from the Planck Surveyor, under the assumption of a symmetric beam profile. Here we restrict ourselves to the case of the 30 GHz channel of the ...

Motion editing is increasingly being accepted as a means for expanding the range of motions available for animating characters with far less expenditure of time and effort than the original motion creation method. Adding flexibility and breadth to motion capture data is particularly valuable, provided the new motions are sufficiently “good.” Computable metrics for determining whether a motion i...

About 40 percent of attempts to sell a house end with the seller not selling. This aspect of behavior has not been studied carefully and, by organizing the data in a way that reveals the behavior of sellers instead of listings, I consider some hypotheses related to the ability of a market process to efficiently allocate resources. First, a change in market conditions may cause the seller to cha...

We easily agree with the following outcome of 20 trials of fair coin toss “01111011001101110001”, but we do not accept the result “00000000000000000000”. However, both results have equal chances given that the fair coin model assumption holds. This is a common example of paradoxes in probability theory, but our reaction is caused by the belief that the first sequence is complicated, but the sec...

In some decision-making environments, successful solutions are common. If the evaluation of candidate solutions is noisy, however, the challenge is knowing when a “good enough” answer has been found. We formalize this problem as an infinite-armed bandit and provide upper and lower bounds on the number of evaluations or “pulls” needed to identify a solution whose evaluation exceeds a given thres...

This document provides a technical specification of the OpenKnowledge (OK) good enough answer (GEA) component. In particular, it discusses: (i) the GEA component architecture, and (ii) the GEA external interface to the other components of the OK system.