Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13, 14] showed how, in principle, one can explicit...
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
The aim of motion detection is to decide whether a given part of an image belongs to a moving object or to the static background. This paper proposes an automatic decision rule for...
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
: As computer performance and graphics hardware continue to improve, the gamer is increasingly being presented with richer and more realistic visual environments. Viewing these vir...