A computational scheme for fitting smoothing spline ANOVA models to large data sets with a (near) tensor product design is proposed. Such data sets are common in spatial-temporal analyses. The proposed scheme uses the backfitting algorithm to take advantage of the tensor product design to save both computational memory and time. Several ways to further speed up the backfitting algorithm, such a...

This paper present the implementation of a new ordering strategy on Successive Overrelaxation scheme on two dimensional boundary value problems. The strategy involve two directions alternatingly; from top and bottom of the solution domain. The method shows to significantly reduce the iteration number to converge. Four numerical experiments were carried out to examine the performance of the new ...

This paper illustrates the current state of development of an algorithm for the steady state solution of continuous-time Markov chains. The so-called multi-level algorithm utilizes ideas from algebraic multigrid to provide an efficient alternative to the currently used Gauss-Seidel and successive overrelaxation methods. The multi-level method has been improved through several iterations, so tha...

The trajectory of a robot is monitored in a restricted dynamic environment using light beam sensor data. We have a Dynamic Belief Network (DBN), based on a discrete model of the domain, which provides discrete mon­ itoring analogous to conventional quantita­ tive filter techniques. Sensor observations are added to the basic D BN in the form of specific evidence. However, sensor data is often pa...

Solids of revolution (vases, bottles, bells, . . .), shortly SORs, are very common objects in man-made environments. We present a complete framework for 3D database population from a single image of a scene including a SOR. The system supports human intervention with automated procedures to obtain good estimates of the interest entities needed for 3D reconstruction. The system exploits the spec...

We present an approach to invariant matching. In this approach, an object or a pattern is invariantly represented by an object-centered description called an attributed relational structure (ARS) embedding invariant properties and relations between the primitives of the pattern such as line segments and points. Noise eeect is taken into account such that a scene can consist of noisy sub-parts o...

We present and study a homographic best approximation problem, which arises in the analysis of waveform relaxation algorithms with optimized transmission conditions. Its solution characterizes in each class of transmission conditions the one with the best performance of the associated waveform relaxation algorithm. We present the particular class of first order transmission conditions in detail...

Although the lift-and-project operators of Lovász and Schrijver have been the subject of intense study, their M(K , K ) operator has received little attention. We consider an application of this operator to the stable set problem. We begin with an initial linear programming (LP) relaxation consisting of clique and non-negativity inequalities, and then apply the operator to obtain a stronger ext...

In the Tree Augmentation problem we are given a tree T = (V, F ) and an additional set E ⊆ V × V of edges, called “links”, with positive integer costs {ce : e ∈ E}. The goal is to augment T by a minimum cost set of links J ⊆ E such that T ∪ J is 2-edge-connected. Let M denote the maximum cost of a link. Recently, Adjiashvili [1] introduced a novel LP for the problem and used it to break the nat...