Sciweavers

AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
13 years 11 months ago
A Generalization of the Massey-Ding Algorithm
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...
Joachim Althaler, Arne Dür
IPL
2007
91views more  IPL 2007»
13 years 11 months ago
Simple deterministic wildcard matching
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...
Peter Clifford, Raphaël Clifford
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 11 months ago
javax.XXL: A prototype for a Library of Query processing Algorithms
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...
SIGECOM
2000
ACM
118views ECommerce» more  SIGECOM 2000»
13 years 11 months ago
Interactions of automated pricing algorithms: an experimental investigation
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...
Cary A. Deck, Bart J. Wilson
SIAMJO
2000
63views more  SIAMJO 2000»
13 years 11 months ago
Pattern Search Methods for Linearly Constrained Minimization
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...
Robert Michael Lewis, Virginia Torczon
SIAMCO
2000
117views more  SIAMCO 2000»
13 years 11 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
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...
Vivek S. Borkar, Sean P. Meyn
RTI
2000
113views more  RTI 2000»
13 years 11 months ago
Algorithms for Fractal Image Compression on Massively Parallel SIMD Arrays
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 ...
Christian Hufnagl, Andreas Uhl
PRL
2000
58views more  PRL 2000»
13 years 11 months ago
Learning mixture models using a genetic version of the EM algorithm
The need to
Aleix M. Martínez, Jordi Vitrià
PC
2000
120views Management» more  PC 2000»
13 years 11 months ago
Real-time sonar beamforming on high-performance distributed computers
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...
Alan D. George, Jeff Markwell, Ryan Fogarty
MOC
2000
62views more  MOC 2000»
13 years 11 months ago
Uzawa type algorithms for nonsymmetric saddle point problems
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...