Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
Data warehouses collect data into materialized views for analysis. After some time, some of the data may no longer be needed or may not be of interest. In this paper, we handle th...
Hector Garcia-Molina, Wilburt Labio, Jun Yang 0001
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
With the widespread popularity of digital images and the presence of easy-to-use image editing software, content integrity can no longer be taken for granted, and there is a stron...