Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost of feature measurement, increase classifier efficiency, and allow greater classification accuracy based on the process of deriving new features from the original features. This paper represents an approach for classif...

The paper shares experience gained in application of dynamic Bayesian approach to control problems in the field of metal rolling. The contribution introduces basic notions of theory applied and provides the algorithmic as well as application-oriented solutions developed. Specifically, the consistent use of the approach resulted in an advanced decision support system for operators of a reversing...

We give an overview of the Edinburgh Skeleton Library eSkel, a structured parallel programming library which offers a range of skeletal parallel programming constructs to the C/MPI programmer. Then we illustrate the efficacy of such a high level approach through an application of multiple baseline stereo. We describe the application and show different ways to introduce parallelism using algorit...

CONTRIBUTIONS 1. Theoretical contribution. We introduce a new, more general lower bound to the policy improvement of an arbitrary policy compared to another policy based on the ability to bound the distance between the future state distributions. 2. Algorithmic contribution. We define two approximate policy–iteration algorithms whose policy improvement moves toward the estimated greedy policy b...

This paper presents a method forfinding and tracking road lanes. The method extracts and tracks lane boundaries for vision-guided vehicle navigation by combining the hough transform and the “active line model ( A M ) ” . The hough transform can extract vanishing points of the road, which can be used as a good estimation of the vehicle heading. For the curved road, however, the estimation may be...

We give a brief and biased survey of the past, present, and future of research on the interface of theoretical computer science and game theory.

The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often sufficient to mine a small representative subset of frequent itemsets with low computational cost. To that end, in this paper, we define a new problem of finding the frequent itemsets with a maximum length and present ...

PhD Thesis written by Benjamín Ramírez González at the Universidad Complutense de Madrid, under the supervision of Dr. Fernando Sánchez León (Real Academia Española, Technology Department). It was defended on February 25th, 2014 at the Instituto Universitario Ortega y Gasset, and it was awarded Summa Cum Laude. The members of the committee were José Lázaro Rodrigo (Universidad Complutense de Ma...