This paper presents the implementation of the coarse-grained reconfigurable architecture (CGRA) DART with on-line error detection intended for increasing fault-tolerance. Most parts of the data paths and of the local memory of DART are protected using residue code modulo 3, whereas only the logic unit is protected using duplication with comparison. These low-cost hardware techniques would allow...

We show how recently-defined abstract models of the Branch & Bound algorithm can be used to obtain information on how the nodes are distributed in B&B search trees. This can be directly exploited in the form of probabilities in a sampling algorithm given by Knuth that estimates the size of a search tree. This method reduces the offline estimation error by a factor of two on search trees from Mi...

In this paper we present a new method for mapping natural speech to lip shape animation in real time. The speech signal, represented by MFCC vectors, is classified into viseme classes using neural networks. The topology of neural networks is automatically configured using genetic algorithms. This eliminates the need for tedious manual neural network design by trial and error and considerably im...

The Dirichlet-Neumann reduced basis method is a model order reduction method for homogeneous domain decomposition of elliptic PDE’s on a-priori known geometries. It is based on an iterative scheme with full offline-online decomposition and rigorous a-posteriori error estimates. We show that the primal-dual framework for non-compliant output quantities can be transferred to this method. The resu...

The University of Amsterdam participated in the Question Answering (QA) Track of CLEF 2005 with two runs. In comparison with previous years, our focus this year was adding to our multi-stream architecture a new stream that uses offline XML annotation of the corpus. We describe the new work on our QA system, present the results of our official runs, and note areas for improvement based on an err...

This paper reports the development of reduced basis approximations, rigorous a posteriori error bounds, and offline-online computational procedures for the accurate, fast and reliable predictions of stress intensity factors or strain energy release rate for “Mode I” linear elastic crack problem. We demonstrate the efficiency and rigor of our numerical method in several examples. We apply our me...

As a prerequisite for precise trajectory tracking of a two-wheeled mobile robot, accurate control of the velocity and the curvature along a predefined trajectory is vital. After offline training, a neural network is used for nonlinear predictive control. To make the system more robust against modeling inaccuracies and other disturbance influences, the control error is integrated and used to adj...

A strategy of user ordering and time labeling for a decision feedback (DF) detector in asynchronous code-division multiple-access communications is proposed and is proved to be optimal for the ideal DF detector. The proposed algorithm requires ( ) offline operations, where is the number of users. Although error propagation complicates the analysis of the actual DF detector, computer simulations...

Motivated by the recent interest in streaming algorithms for processing large text collections, we revisit the work of Ravichandran et al. (2005) on using the Locality Sensitive Hash (LSH) method of Charikar (2002) to enable fast, approximate comparisons of vector cosine similarity. For the common case of feature updates being additive over a data stream, we show that LSH signatures can be main...