Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
: A concept for identification of candidates for outliers is presented, with a focus on nominal variables. The database concerned is searched for rules that are almost universally...
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamar...
Ilias S. Kotsireas, Christos Koukouvinos, Jennifer...
Abstract. Vector quantization (VQ) is an elementary technique for image compression. However, the complexity of searching the nearest codeword in a codebook is time-consuming. In t...