– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
In this paper we show that Ullman and Basri’s linear combination (LC) representation, which was originally proposed for alignment-based object recognition, can be used for outli...
After developing a model free table recognition system we wanted to tune parameters in order to optimize the recognition performance. Therefore we developed a benchmarking environ...
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...