The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
In this paper we describe XXL (eXtensible and fleXible Library), a toolkit for rapid prototyping query processing algorithms. XXL is a flexible, high-level, platform independent J...
Jochen Van den Bercken, Jens-Peter Dittrich, Bernh...
The advent of electronic commerce enables retailers to set prices via automated algorithms. This paper employs the method of experimental economics to examine human behavior in en...
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that con...
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
In this work we introduce and analyze algorithms for fractal image compression on massively parallel SIMD arrays. The di erent algorithms discussed di er signi cantly in terms of ...
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...
In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block fo...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...