Pattern databases have been successfully applied to several problems. Their use assumes that the goal state is known, and once the pattern database is built, commonly it can be used by all instances. However, in Sokoban, before solving the puzzle, the goal position of each stone is unknown. Moreover, each Sokoban instance has its own state space search. In this paper we apply pattern databases ...

All algorithms below are optimal alphabet-independent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the string-matching problem, we design an algorithm that computes a deterministic sample of a suu-ciently long substring in constant time. This problem used to be a bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The ...

Magnetic resonance (MR) tagging 1, 2] is a technique used to impose a known intensity pattern, called a tag pattern, on an object by spatially modulating the object's proton spin density before the image is acquired. Since the tag pattern moves with the object, MR tagging is particularly useful in the estimation of deformable motion from MR image sequences because some tag patterns can resolve ...

The modelling of pattern formation in biological systems using various models of reaction-diffusion type has been an active research topic for many years. We here look at a parameter identification (or PDE-constrained optimization) problem where the Schnakenberg and Gierer-Meinhardt equations, two well-known pattern formation models, form the constraints to an objective function. Our main focus...

We give an alphabet-independent optimal parallel algorithm for the searching phase of three dimensional pattern-matching. All occurrences of a three dimensional pattern P of shape m m m in a text T of shape nn n are to be found. Our algorithm works in log m time with O(N= log(m)) processors of a CREW PRAM, where N = n 3. The searching phase in three dimensions explores classiication of two-dime...

The aim of this work is to determine the best landmark for its use in tasks such as precise positioning of AGVs or mobile robots in front of loading / unloading areas. The work developed aims at determining the precision that can be achieved with different pattern landmarks, of use in positioning systems, based on computer vision. Different computer vision algorithms have been tested from the i...

We address the problem of authenticating pattern matching queries over textual data that is outsourced to an untrusted cloud server. By employing cryptographic accumulators in a novel optimal integritychecking tool built directly over a suffix tree, we design the first authenticated data structure for verifiable answers to pattern matching queries featuring fast generation of constant-size proo...

In this paper we present a foundational basis for optimal and information theoretic syntactic pattern recognition. We do this by developing a rigorous model, M*, for channels which permit arbitrarily distributed substitution, deletion and insertion syntactic errors. More explicitly, if A is any finite alphabet and A* the set of words over A, we specify a stochastically consistent scheme by whic...

A Bayer pattern image codec method based on Wyner-Ziv structure is proposed in this paper. At the encoder the pixel of Bayer pattern image is converted into four component images by means of structural separation and transformation. Three of them are transformed into frequency domain by the discrete cosine transform. We extended the Lloyd iterative algorithm and designed an optimal scalar quant...

We have found the first optimal solutions to random instances of Rubik’s Cube. The median optimal solution length appears to be 18 moves. The algorithm used is iterative-deepening-A* (IDA*), with a lowerbound heuristic function based on large memory-based lookup tables, or “pattern databases” (Culberson and Schaeffer 1996). These tables store the exact number of moves required to solve various ...