It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
—A new method for fractal image compression is proposed using genetic algorithm (GA) with elitist model. The self transformability property of images is assumed and exploited in ...
The NRL Network Pump R , or Pump, is a standard for mitigating covert channels that arise in a multi-level secure (MLS) system when a high user (HU) sends acknowledgements to a low...
Siva K. Gorantla, Sachin Kadloor, Todd P. Coleman,...
In this paper we present a comparative study on fusion of visual and thermal images using different wavelet transformations. Here, coefficients of discrete wavelet transforms from...
Mrinal Kanti Bhowmik, Debotosh Bhattacharjee, Mita...