We consider the finite binary words Z(n), n ∈ N, defined by the following selfsimilar process: Z(0) := 0, Z(1) := 01, and Z(n + 1) := Z(n) · Z(n − 1), where the dot · deno...
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Performance evaluation of content-based image retrieval (CBIR) systems is an important but still unsolved problem. The reason for its importance is that only performance evaluatio...
Retrofitting security implementations to a released software-intensive system or to a system under development may require significant architectural or coding changes. These late...
Abstract--This paper considers the problem of high-dynamicrange (HDR) image capture using low-dynamic-range (LDR) cameras. We present three different minimal-bracketing algorithms ...