We compare two load balancing techniques for Cayley graphs based on information and load exchange between neighboring vertices. In the rst scheme, called natural di usion, each vertex gives (or receives) a xed part of the load di erence to (from) its direct neighbors. In the second scheme, called Cayley di usion, each vertex successively gives (or receives) a part of the load di erence to (or f...

Experimental evaluations for path estimation are performed on an abb irb4600 robot. Di erent observers using Bayesian techniques with di erent estimation models are proposed. The estimated paths are compared to the true path measured by a laser tracking system. There is no signi cant di erence in performance between the six observers. Instead, execution time, model complexities and implementati...

This paper presents and analyzes four explicit, two implicit and four semi-implicit finite difference algorithms for the linear shape from shading problem. Comparisons of accuracy, solvability, stability and convergence of these schemes indicate that the weighted semi-implicit scheme and the box scheme are better than the other ones because they can be calculated more easily, they are more accu...

Phase based methods for extracting binocular dispar ity are discussed including phase di erence methods and phase correlation A third method is also described that combines some of their properties and appears consistent with recent physiological data

In this paper, we present a new way of viewing Xia's construction of Hadamard diierence sets. Based on this new point of view, we give a character theoretic proof for Xia's construction. Also we point out a connection between the construction and projective three-weight codes.

We have calculated analytical expressions for how the bias and variance of the estimators provided by various temporal di erence value estimation algorithms change with o ine updates over trials in absorbing Markov chains using lookup table representations. We illustrate classes of learning curve behavior in various chains, and show the manner in which TD is sensitive to the choice of its steps...

Finite diierence schemes for singularly perturbed convection problems are studied in the limit case in which the viscosity approaches zero with the mesh-size. The error estimates allow choosing in advance appropriate schemes and mesh-resolutions for both boundary layer problems and circulating ow problems.

In pattern set mining we are after a small set of patterns that together are characteristic for the data at hand. In this paper we consider the problem of characterizing not one, but a set of sequence databases, such as a collection of articles or the chapters of a book. Our main objective is to find a set of patterns that captures the individual features of each database, while also finding sh...

The amplitude computation requires an accurate approximation for the traveltime gradient and Laplacian. Since it is hard to compute the traveltimes with a secondor higher-order accuracy in realistic media, the di erence approximations of the traveltime derivatives may not be suitable for accurate amplitudes unless special cares are taken. This article is concerned with a concurrent simulation o...

A graph G is stable if its normalized chromatic difference sequence is equal to the normalized chromatic di erence sequence of G G, the Cartesian product of G with itself. Let be the independence number of G and ! be its clique number. Suppose that G has n vertices. We show that the rst ! terms of the normalized chromatic di erence sequence of a stable graph G must be =n; and further that if G ...